Skip to content

Commit faa765c

Browse files
committed
更新目录
1 parent 4e8d390 commit faa765c

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1059,7 +1059,7 @@
10591059
| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0992.%20Subarrays%20with%20K%20Different%20Integers) | 45.20% | Hard | |
10601060
| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0993.%20Cousins%20in%20Binary%20Tree) | 52.40% | Easy | |
10611061
| 0994 | Rotting Oranges | | 46.40% | Easy | |
1062-
| 0995 | Minimum Number of K Consecutive Bit Flips | | 48.40% | Hard | |
1062+
| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0995.%20Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips) | 48.40% | Hard | |
10631063
| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0996.%20Number%20of%20Squareful%20Arrays) | 47.80% | Hard | |
10641064
| 0997 | Find the Town Judge | | 49.10% | Easy | |
10651065
| 0998 | Maximum Binary Tree II | | 61.60% | Medium | |

0 commit comments

Comments
 (0)