-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTest_cases
48 lines (42 loc) · 809 Bytes
/
Test_cases
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
39
40
41
42
43
44
45
46
47
48
Case 1:
int grid[][] = new int[][]{
{1,1,1,1,0},
{1,1,1,1,1},
{1,1,0,1,1},
{1,0,1,0,1},
{1,1,1,1,1}
};
pair source = new pair(0,0);
pair destination = new pair(3,2);
Case 2:
int grid[][] = new int[][]{
{1,1,1,1,0},
{1,1,1,1,1},
{1,1,0,1,1},
{1,0,1,0,1},
{1,1,1,1,1}
};
pair source = new pair(0,0);
pair destination = new pair(4,4);
Case 3:
int grid[][] = new int[][]{
{1,1,1,1,1,1,1},
{1,1,1,1,1,1,1},
{1,1,1,0,1,1,1},
{1,1,1,1,1,1,1},
{1,0,1,0,1,1,1},
{1,1,1,0,1,1,1},
{1,1,1,1,1,1,1}
};
pair source = new pair(2,1);
pair destination = new pair(5,4);
Case 4:
int grid[][] = new int[][]{
{1,1,1,1,1},
{1,1,1,1,1},
{1,1,1,1,1},
{1,1,1,0,0},
{1,1,1,0,1}
};
pair source = new pair(0,0);
pair destination = new pair(4,4);