文件名称：leetcode2sumc-LeetCode-Codes-and-Notes:这是我在LeetCode.com上的学习记录
文件大小：90KB
文件格式：ZIP
更新时间：2024-07-26 11:34:13
系统开源
leetcode 2 sum c LeetCode-Codes-and-Notes Here is a record of my learning on LeetCode. CATALOG No. Date Title Tag Notes 1 2020.08.06 Array Hash Map 1. 加快查找的速度：哈希表牺牲空间换时间；2. 泛型，避免集合使用中的强制类型转换. 2 2020.08.06 LinkedList recursion iteration 1. 在普遍解法中包含特殊情况，利用 0 与 null；2. 一种单链表的反向操作，head.next.next = head; ；3. 变量名的指代性，prev curr next temp . 3 2020.08.07 stack double-stack stack-plus 1. double stack: 维护一个辅助栈来拓展功能；2. stack plus: 设计一个增强型栈，它同时存储基础数据和功能性数据. 4 2020.08.08 Circular queue 1. 多种情形的统一：使用 Math.max(
【文件预览】：
LeetCode-Codes-and-Notes-master
----README.md(34KB)
----Notes()
--------Hamming-Weight.md(1KB)
--------Length-Of-Longest-Substring.md(2KB)
--------Find-Continuous-Sequence.md(2KB)
--------Divide.md(2KB)
--------MergeTwoList.md(2KB)
--------Cutting-Rope.md(2KB)
--------Copy-Random-List.md(2KB)
--------Kth-Largest-Of-Search-Tree.md(2KB)
--------Construct-Arr.md(1KB)
--------Lowest-Common-Ancestor.md(4KB)
--------Two-Sum.md(2KB)
--------Level-Order.md(4KB)
--------Sort-Colors.md(2KB)
--------Path-Sum.md(3KB)
--------Find-Nth-Digit.md(1KB)
--------Subtree-of-Another-Tree.md(3KB)
--------Reconstruct-A-Binary-Tree.md(6KB)
--------Min-Number-Formed-By-Strings.md(11KB)
--------Max-Value.md(1KB)
--------strStr.md(2KB)
--------Max-Queue.md(2KB)
--------Moving-Average-from-Data-Stream.md(3KB)
--------Add.md(1KB)
--------Is-Balanced.md(2KB)
--------Print-Numbers.md(2KB)
--------Reverse-Linked-List.md(1KB)
--------Get-Least-Numbers.md(4KB)
--------Reverse-Words-In-A-String.md(5KB)
--------My-Pow.md(1KB)
--------min-Array.md(2KB)
--------Generate-Parenthesis.md(2KB)
--------Last-Remaining.md(1KB)
--------Permutation.md(2KB)
--------String-To-Int.md(5KB)
--------Get-Intersection-Node.md(3KB)
--------Max-Sliding-Window.md(5KB)
--------Symmetric-Tree.md(2KB)
--------minStack.md(2KB)
--------Diameter-of-Binary-Tree.md(2KB)
--------Binary-Tree-Right-Side-View.md(2KB)
--------Swap-Pairs.md(2KB)
--------First-Uniq-Char.md(1KB)
----Codes()
--------list.java(0B)
--------IsNumber.java(1KB)
--------MedianFinder.java(1KB)
--------Node.java(171B)
--------UniquePathsWithObstacles.java(1KB)
--------ListNode.java(90B)
--------TreeNode.java(644B)
--------MinNumber.java(3KB)
--------RestoreIpAddresses.java(2KB)
--------MergeTwoList.java(936B)
--------PathSum.java(711B)
--------Add.java(289B)
--------Draft.java(1KB)
--------ReversePrint.java(606B)
--------Permutation.java(1KB)
--------StringToInt.java(1KB)
--------DiameterOfATree.java(436B)
--------CopyRandomList.java(690B)
--------FindNthDigit.java(396B)
--------MovingAverage.java(465B)
--------VerifyPostorder.java(967B)
--------PrintNumbers.java(886B)
--------BuildTree.java(571B)
--------LowestCommonAncestor.java(811B)
--------SubTree.java(701B)
--------LevelTraversal.java(3KB)
--------ReverseWordsInAString.java(670B)
--------TwoSum.java(729B)
--------Test.java(526B)
--------MaxSlidingWindow.java(3KB)
--------IsSymmetric.java(724B)
--------Solution.java(830B)
--------CQueue.java(613B)
--------GetKthFromEnd.java(397B)
--------MirrorTree.java(305B)
--------minStack.java(719B)
--------MaxQueue.java(1KB)
--------KthLargestOfSearchTree.java(366B)
--------SideViewOfATree.java(519B)
--------ReconsructATree.java(2KB)
--------MaxValue.java(740B)
----.gitattributes(66B)
----template()
--------Sunday.md(1KB)
--------quicksort.md(1KB)
--------mergesort.md(1KB)