8000 [LEET-529] add 529 · aduispace/Leetcode-1@d7c2dfc · GitHub
[go: up one dir, main page]

Skip to content 8000

Commit d7c2dfc

Browse files
[LEET-529] add 529
1 parent 233aa4c commit d7c2dfc

File tree

2 files changed

+1
-1
lines changed

2 files changed

+1
-1
lines changed

leetcode-algorithms/README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@
44
| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes
55
|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
66
|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS
7+
|529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/Minesweeper.java) | O(m*n) |O(k) | Medium | BFS
78
|520|[Detect Capital](https://leetcode.com/problems/detect-capital/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/DetectCapital.java) | O(n) |O(1) | Easy|
89
|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLargestValueinEachTreeRow.java) | O(n) |O(k) | Medium| BFS
910
|513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindBottomLeftValue.java) | O(n) |O(k) | Medium| BFS

leetcode-algorithms/src/main/java/com/stevesun/solutions/ContainsDuplicateIII.java

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,6 @@ public class ContainsDuplicateIII {
3636
* we continue. Return false when we finished the loop.
3737
*/
3838

39-
//Really, computing is all about data structures! Cool! Learned the gist again!
4039
public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
4140
TreeSet<Integer> set = new TreeSet<Integer>();
4241
for(int i = 0; i < nums.length; i++){

0 commit comments

Comments
 (0)
0