leetcode-java/src/test/java/com/leetcode/hard/LongestIncreasingPathInAMatrix329Test.java at main · kobukuro/leetcode-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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
package com.leetcode.hard;

import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;

import java.time.Duration;

import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertTimeoutPreemptively;

public class LongestIncreasingPathInAMatrix329Test {
    private LongestIncreasingPathInAMatrix329 solution;

    @BeforeEach
    void setUp() {
        solution = new LongestIncreasingPathInAMatrix329();
    }

    @Test
    void testLongestIncreasingPath_Example1() {
        int[][] matrix = {
                {9, 9, 4},
                {6, 6, 8},
                {2, 1, 1}
        };
        int expected = 4;

        int result = assertTimeoutPreemptively(Duration.ofMillis(100), () -> solution.longestIncreasingPath(matrix));

        assertEquals(expected, result);
    }

    @Test
    void testLongestIncreasingPath_Example2() {
        int[][] matrix = {
                {3, 4, 5},
                {3, 2, 6},
                {2, 2, 1}
        };
        int expected = 4;

        int result = assertTimeoutPreemptively(Duration.ofMillis(100), () -> solution.longestIncreasingPath(matrix));

        assertEquals(expected, result);
    }

    @Test
    void testLongestIncreasingPath_Example3() {
        int[][] matrix = {
                {1}
        };
        int expected = 1;

        int result = assertTimeoutPreemptively(Duration.ofMillis(100), () -> solution.longestIncreasingPath(matrix));

        assertEquals(expected, result);
    }

    @Test
    void testLongestIncreasingPath_Example4() {
        int[][] matrix = {{0, 1, 2, 3, 4, 5, 6, 7, 8, 9},
                {19, 18, 17, 16, 15, 14, 13, 12, 11, 10},
                {20, 21, 22, 23, 24, 25, 26, 27, 28, 29},
                {39, 38, 37, 36, 35, 34, 33, 32, 31, 30},
                {40, 41, 42, 43, 44, 45, 46, 47, 48, 49},
                {59, 58, 57, 56, 55, 54, 53, 52, 51, 50},
                {60, 61, 62, 63, 64, 65, 66, 67, 68, 69},
                {79, 78, 77, 76, 75, 74, 73, 72, 71, 70},
                {80, 81, 82, 83, 84, 85, 86, 87, 88, 89},
                {99, 98, 97, 96, 95, 94, 93, 92, 91, 90},
                {100, 101, 102, 103, 104, 105, 106, 107, 108, 109},
                {119, 118, 117, 116, 115, 114, 113, 112, 111, 110},
                {120, 121, 122, 123, 124, 125, 126, 127, 128, 129},
                {139, 138, 137, 136, 135, 134, 133, 132, 131, 130},
                {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
        int expected = 140;

        int result = assertTimeoutPreemptively(Duration.ofMillis(100), () -> solution.longestIncreasingPath(matrix));

        assertEquals(expected, result);
    }

}