CareerCup

@tuttobenethx

Thanks for sharing your thoughts. Can you tell me the time complexity of bleed solution

And better solution is not correct solution
if we give manPosRow = 9 and manPosCol = 3 then answer should be zero

but it is giving 4

package com.algorithms.test;

public class LongestPathInMatrixWith01 {

	public static int FindLongestSequences(int[][] matrix, int row,int col){
		int maxCnt = 0;
		
		for(int i=0;i<row;i++){
			for(int j=0;j<col;j++){
				int a = (i==0) ? 0: matrix[(i-1)][j];
				int b = (j==0) ? 0: matrix[i][j-1];
				System.out.println("i: "+i+"   j:"+ j);
				System.out.println("a: "+a+"  b:"+b+"  "+matrix[i][j]);
				matrix[i][j] =( matrix[i][j]>0) ? max(a,b)+1 :0;
				System.out.println(matrix[i][j]);
				maxCnt = max(maxCnt,matrix[i][j]);
			}
		}
		
		
		for(int i=0;i<row;i++){
			for(int j=0;j<col;j++){
				System.out.print(matrix[i][j]);
			}
			
			System.out.println();
		}
		
		
		return maxCnt;
	}
	
	
	public static int max(int a , int b){
		return (a>b) ? a :b;
	}
	
	public static void DoTest(int[][] matrix, int rows, int col){
		if(matrix == null ) return;
		
		if(rows < 1) return;
		
		if(col < 1) return;
		
		for(int i=0;i<rows;i++){
			for(int j=0;j<col;j++){
				System.out.print(matrix[i][j]);
			}
			
			System.out.println();
		}
		
		int len = FindLongestSequences(matrix, rows, col);
		System.out.println("Maximum Length "+len);
	}
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int[][] matrix = {
		        {0, 0, 0, 1, 1}, 
		        {1, 1, 1, 0, 1}, 
		        {0, 1, 1, 1, 0}, 
		        {0, 0, 1, 0, 0}, 
		        {1, 1, 1, 1, 1}
		    };
	
	
	DoTest(matrix,matrix.length,matrix[0].length);
	
	
	}

}

@PeyarTheriyaa
I had a similar solution. But I am wondering if there any better time and space complexity.

Thanks for sharing your thought

Why is example wrong?

Input: 111222289
output: 31421819

Program should be return above output for that input