DataStructure-Algorithm-in-java/MazePathMMPrint.java at master · 14visheshjain/DataStructure-Algorithm-in-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package lecture9;

import java.util.ArrayList;
import java.util.Scanner;

public class MazePathMMPrint {

	public static void main(String[] args) {
		Scanner a = new Scanner(System.in);

		int r1 = a.nextInt();
		int c1 = a.nextInt();
		int r2 = a.nextInt();
		int c2 = a.nextInt();
		Mazepathmm(r1, c1, r2, c2 , "");
	}

	public static void Mazepathmm(int sr, int sc, int er, int ec , String ans) {
		if (sr == er && sc == ec) {
			System.out.println(ans);
			}


		for (int row = 1; row + sr <= er; row++) {
		 Mazepathmm(sr + row, sc, er, ec , ans+"V" + row);

		}
		for (int col = 1; col + sc <= ec; col++) {
			 Mazepathmm(sr, sc + col, er, ec , ans+"H" + col);
		}
		for (int diagonal = 1; diagonal + sc <= ec && diagonal + sr <= er; diagonal++) {
		 Mazepathmm(sr + diagonal, sc + diagonal, er, ec , ans+"D"+diagonal);

		}

	}

}