Skip to content

Commit b62b5ab

Browse files
fishercoder1534fishercoder1534
committed
add 1424
1 parent 86c5013 commit b62b5ab

File tree

3 files changed

+75
-2
lines changed

3 files changed

+75
-2
lines changed

Diff for: ‎paginated_contents/algorithms/2nd_thousand/README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -221,7 +221,7 @@
221221
| 1471 | [The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1471.java) | | Medium | Array, Sort |
222222
| 1470 | [Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | | Easy | Array |
223223
| 1469 | [Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1469.java) | | Easy | Tree, DFS |
224-
| 1466 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) | | Medium | Tree, DFS, BFS |
224+
| 1466 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) | | Medium | Tree, DFS, BFS |
225225
| 1464 | [Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1464.java) | | Easy | Array |
226226
| 1461 | [Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1461.java) | | Medium | String, Bit Manipulation |
227227
| 1460 | [Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1460.java) | | Easy | Array |
@@ -245,6 +245,7 @@
245245
| 1428 | [Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1428.java) | | Medium | Array |
246246
| 1427 | [Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1427.java) | | Easy | Array, Math |
247247
| 1426 | [Counting Elements](https://leetcode.com/problems/counting-elements/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1426.java) | | Easy | Array |
248+
| 1424 | [Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1424.java) | | Medium | Matrix |
248249
| 1423 | [Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1423.java) | | Medium | Array, DP, Sliding Window |
249250
| 1422 | [Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1422.java) | | Easy | String |
250251
| 1418 | [Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1418.java) | | Medium | HashTable |
@@ -410,7 +411,7 @@
410411
| 1065 | [Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1065.java) | | Medium ||
411412
| 1062 | [Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1062.java) | | Medium | String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function |
412413
| 1061 | [Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1061.java) | [:tv:](https://youtu.be/HvCaMw58_94) | Medium | Union Find
413-
| 1060 | [Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1060.java) | | Medium ||Binary Search
414+
| 1060 | [Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1060.java) | | Medium ||Binary Search
414415
| 1057 | [Campus Bikes](https://leetcode.com/problems/campus-bikes/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1057.java) | | Medium ||Greedy, Sort
415416
| 1056 | [Confusing Number](https://leetcode.com/problems/confusing-number/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1056.java) | | Easy ||
416417
| 1055 | [Fixed Point](https://leetcode.com/problems/fixed-point/) | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1055.java) | | Easy ||

Diff for: ‎src/main/java/com/fishercoder/solutions/_1424.java

+29
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.*;
4+
5+
public class _1424 {
6+
public static class Solution1 {
7+
/**
8+
* One key note:
9+
* For all elements on the same diagonal, the sums of their row index and column index are equal.
10+
* This is widely applicable to all matrix problems.
11+
*/
12+
public int[] findDiagonalOrder(List<List<Integer>> nums) {
13+
TreeMap<Integer, List<Integer>> map = new TreeMap<>();
14+
for (int i = 0; i < nums.size(); i++) {
15+
for (int j = 0; j < nums.get(i).size(); j++) {
16+
int index = i + j;
17+
List<Integer> list = map.getOrDefault(index, new ArrayList<>());
18+
list.add(0, nums.get(i).get(j));
19+
map.put(index, list);
20+
}
21+
}
22+
List<Integer> list = new ArrayList<>();
23+
for (int index : map.keySet()) {
24+
list.addAll(map.get(index));
25+
}
26+
return list.stream().mapToInt(Integer -> Integer).toArray();
27+
}
28+
}
29+
}

Diff for: ‎src/test/java/com/fishercoder/_1424Test.java

+43
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
package com.fishercoder;
2+
3+
import com.fishercoder.solutions._1424;
4+
import org.junit.jupiter.api.BeforeEach;
5+
import org.junit.jupiter.api.Test;
6+
7+
import java.util.Arrays;
8+
9+
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
10+
11+
public class _1424Test {
12+
private static _1424.Solution1 solution1;
13+
14+
@BeforeEach
15+
public void setup() {
16+
solution1 = new _1424.Solution1();
17+
}
18+
19+
@Test
20+
public void test1() {
21+
assertArrayEquals(new int[]{1, 4, 2, 7, 5, 3, 8, 6, 9}, solution1.findDiagonalOrder(
22+
Arrays.asList(
23+
Arrays.asList(1, 2, 3),
24+
Arrays.asList(4, 5, 6),
25+
Arrays.asList(7, 8, 9)
26+
))
27+
);
28+
}
29+
30+
@Test
31+
public void test2() {
32+
assertArrayEquals(new int[]{1, 6, 2, 8, 7, 3, 9, 4, 12, 10, 5, 13, 11, 14, 15, 16}, solution1.findDiagonalOrder(
33+
Arrays.asList(
34+
Arrays.asList(1, 2, 3, 4, 5),
35+
Arrays.asList(6, 7),
36+
Arrays.asList(8),
37+
Arrays.asList(9, 10, 11),
38+
Arrays.asList(12, 13, 14, 15, 16)
39+
))
40+
);
41+
}
42+
43+
}

0 commit comments

Comments
 (0)