Rat Chases its cheese problem , Java

justformyntra8 · May 25, 2019, 11:16am

i am getting no output for 2 test cases
kindly let me know where im going wrong.

bhardwaj-aman/java-data-structures-practice-questions/blob/master/recursion- rat in a maze problem

package RECURSIONPRACTICE;
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+1];
        // 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++){

This file has been truncated. show original

Riyabansal98 · May 26, 2019, 7:10am

HI @justformyntra8

For the case
5 7
OXOOOOX
OXOXOXX
OXOXOOX
OOOXOXX
XXOXXXX
There is no possible path. Hence you need to print NO PATH FOUND in the case.
You have not handled that case.

Riyabansal98 · May 31, 2019, 6:03am

Hi Aman
As you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if
required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.

Riyabansal98 · May 31, 2019, 6:03am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

justformyntra8 · May 31, 2019, 5:48pm

Thanks- that solved it