deno.land / x / masx200_leetcode_test@10.6.5 / minimum-path-cost-in-a-hidden-grid / test.ts

نووسراو ببینە
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
49
import { assertEquals } from "../deps.ts";import { GridMaster } from "./GridMaster.ts";import findShortestPath from "./index.ts";
Deno.test("minimum-path-cost-in-a-hidden-grid", () => { const inputs: [ grid: number[][], r1: number, c1: number, r2: number, c2: number, ][] = [[[[2, 3], [1, 1]], 0, 1, 1, 0], [ [[0, 3, 1], [3, 4, 2], [1, 2, 0]], 2, 0, 0, 2, ], [ [[1, 0], [0, 1]], 0, 0, 1, 1, ]]; assertEquals( inputs.map((g) => findShortestPath(new GridMaster(...g))), [2, 9, -1], );});
Deno.test("GridMaster", () => { const grid = [[2, 3], [1, 1]], r1 = 0, c1 = 1, r2 = 1, c2 = 0; const master = new GridMaster(grid, r1, c1, r2, c2); assertEquals(false, master.canMove("U")); //returns false. assertEquals(true, master.canMove("D")); //returns true. assertEquals(true, master.canMove("L")); // returns true. assertEquals(false, master.canMove("R")); // returns false. assertEquals(2, master.move("L")); // moves the robot to the cell (0, 0) and assertEquals(true,returns 2. assertEquals(false, master.isTarget()); // returns false. assertEquals(false, master.canMove("U")); //returns false. assertEquals(true, master.canMove("D")); //returns true. assertEquals(false, master.canMove("L")); //returns false. assertEquals(true, master.canMove("R")); //returns true. assertEquals(1, master.move("D")); // moves the robot to the cell (1, 0) and assertEquals(true,returns 1. assertEquals(true, master.isTarget()); // returns true. assertEquals(-1, master.move("L")); //doesn"t move the robot and returns -1. assertEquals(1, master.move("R")); // moves the robot to the cell (1, 1) and returns 1.});
masx200_leetcode_test

Version Info

Tagged at
a year ago