Rat in a maze Java

justformyntra8 · June 6, 2019, 7:03pm

I just want to print the last possible path, but my code is returning all possible paths.
What should I change?

bhardwaj-aman/java-data-structures-practice-questions/blob/master/Recursion And BackTracking/Rat in a maze

import java.util.*;
public class Main {
    public static void main(String args[]) {
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        int b = s.nextInt();
        s.nextLine();
        // System.out.println(b);
        String[] str = new String [a];
        // System.out.println("a is: "+a + " b is :"+b);

        for(int i=0;i<a;i++){
            str[i]=s.nextLine();
        }
        // System.out.println(str[0]);

        String[][] str2 = new String [a][b];
        for(int i=0;i<a;i++){
            for(int j=0;j<b;j++){
                str2[i][j]=str[i].charAt(j)+"";

This file has been truncated. show original

Jaa18Crx0002 · June 7, 2019, 9:40am

Hi Aman,
In this question there will be only two recursive call one rightward and second downward. Also any cell of solution matrix will be 1 when any one of the two call returns true. If none call returns true then that cell of solution matrix will be 0 and finally return false.