ReviewPage.md: 所有题目的总结和归纳(不断完善中) KnowledgeHash2.md: 对所做过的知识点的一些笔记 SystemDesign.md: 对系统设计的一些笔记 Future Milestone: 我准备将一些有意思的题目,做成视频的形式给大家参考 在这里! 安利一下自己的副业 介绍一下自己! 大家在YouTube或者B站都可以搜到我: "张土汪" You...
design_graph_short_path.c design_graph_short_path.py design_hashmap.c design_hashmap.py design_hashset.c design_linked_list.c design_linked_list.py design_number_container.py design_parking_system.c design_stack_increment_op.c design_stack_increment_op.py design_underground_system.c destinatio...
ReviewPage.md: 所有题目的总结和归纳(不断完善中) KnowledgeHash2.md: 对所做过的知识点的一些笔记 SystemDesign.md: 对系统设计的一些笔记 001 | about 土汪 tuwangbrick.substack.com 是2022年开启的一个news letter周刊, 每周一更新, 内容是一些工作上遇到的思考, 介绍些遇到的新工具, 偶尔吐槽. 欢迎大家...
2434-design-a-number-container-system 2448-count-number-of-bad-pairs 2473-max-sum-of-a-pair-with-equal-sum-of-digits String 1915-check-if-one-string-swap-can-make-strings-equal 3447-clear-digits 2021-remove-all-occurrences-of-a-substring Counting 1915-check-if-one-string-swap-can-make-str...
ReviewPage.md: 所有题目的总结和归纳(不断完善中) KnowledgeHash2.md: 对所做过的知识点的一些笔记 SystemDesign.md: 对系统设计的一些笔记 Future Milestone: 我准备将一些有意思的题目,做成视频的形式给大家参考 希望大家学习顺利, 对未来充满希望(程序员也是找到好老板的!) 有问题可以给我写邮件(wangdeve@gma...
0630.Course Schedule III.py 0632.Smallest Range Covering Elements from K Lists.py 0633.Sum of Square Numbers.py 0634.Find the Derangement of An Array.py 0635.Design Log Storage System.py 0636.Exclusive Time of Functions.py 0637.Average of Levels in Binary Tree.py 0638.Shopping Offers.py 063...
1125-design-file-system 1129-shortest-path-with-alternating-colors 113-path-sum-ii 1136-parallel-courses 1137-height-checker 1137-n-th-tribonacci-number 1138-grumpy-bookstore-owner 114-flatten-binary-tree-to-linked-list 1144-decrease-elements-to-make-array-zigzag 1150-check-if-a-number-is-major...
✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% / LeetCode 题解 books.halfrost.com/leetcode MIT License 0 stars 1.2k forks Star Watch Code Pull requests Actions Projects Security Insights master 4 branches 2 tags Go to file Code Clone HTTPS GitHub ...
No_1396_Design Underground System No_1399_Count Largest Group No_1403_Minimum Subsequence in Non-Increasing Order No_1404_Number of Steps to Reduce a Number in Binary Representation to One No_1408_String Matching in an Array No_1409_Queries on a Permutation With Key No_1410_HTML Entit...
public void f(int arr[]) { int[] temp = new int[21]; for (int i = 0; i < arr.length; i++) { temp[arr[i]]++; } //顺序打印 for (int i = 0; i < 21; i++) { for (int j = 0; j < temp[i]; j++) { System.out.println(i); } } } 利用数组下标的应用还有很多...