文件名称：lrucacheleetcode-LeetCode:解决LeetCode中的问题http://oj.leetcode.com/
文件大小：50KB
文件格式：ZIP
更新时间：2024-07-19 17:01:38
系统开源
lru缓存leetcode 力码 解决 LeetCode 中的问题。 二和 Hashtabl O(n), hashmap[value] = index + 1 Sorting O(nlogn), neet to find index in the origial vector 字符串转整数 Use long long to make sure the string can be converted, then check whether it exceeds INT_MAX/INT_MIN. 3 总和 Size of vector >= 3 Three pointers, one move from 0 to n-1, other two are the same as in Two Sum Check duplicates 有效的副词 Stack is not empty, all paratheses are left paratheses. 合并两个排序列表 Use a dummy node, link the next to the new Listnode with t
【文件预览】：
LeetCode-master
----ConstructBinaryTreefromPreorderandInorderTraversal.cpp(1014B)
----.gitignore(126B)
----RemoveDuplicatesfromSortedList.cpp(675B)
----SearchinRotatedSortedArray.cpp(737B)
----TwoSum.cpp(2KB)
----MergeTwoSortedLists.cpp(783B)
----PathSum.cpp(1KB)
----DivideTwoIntegers.cpp(958B)
----MinimumPathSum.cpp(637B)
----Anagrams.cpp(640B)
----RomantoInteger.cpp(648B)
----FlattenBinaryTreetoLinkedList.cpp(1KB)
----StringtoInteger.cpp(2KB)
----SearchinRotatedSortedArrayII.cpp(802B)
----IntegertoRoman.cpp(788B)
----GenerateParentheses.cpp(644B)
----MedianofTwoSortedArrays.cpp(858B)
----Searcha2DMatrix.cpp(789B)
----Pow.cpp(511B)
----UniquePaths.cpp(524B)
----LinkedListCycleII.cpp(747B)
----SwapNodesinPairs.cpp(798B)
----ConvertSortedListtoBinarySearchTree.cpp(1KB)
----AddBinary.cpp(541B)
----NQueens.cpp(1KB)
----ValidParatheses.cpp(937B)
----Subsets.cpp(805B)
----ReorderList.cpp(1KB)
----BinaryTreeLevelOrderTraversal.cpp(1KB)
----RemoveElement.cpp(403B)
----UniquePathsII.cpp(1KB)
----EditDistance.cpp(829B)
----CombinationSum.cpp(1KB)
----RemoveNthNodeFromEndofList.cpp(854B)
----MaximumSubarray.cpp(745B)
----ReverseInteger.cpp(953B)
----MergeSortedArray.cpp(568B)
----README.md(11KB)
----SurroundedRegions.cpp(1KB)
----MergekSortedLists.cpp(825B)
----ClimbingStairs.cpp(413B)
----LinkedListCycle.cpp(612B)
----ConvertSortedArraytoBinarySearchTree.cpp(718B)
----PalindromePartitioningII.cpp(787B)
----BinaryTreePreorderTraversal.cpp(1KB)
----Permutations.cpp(656B)
----PalindromePartitioning.cpp(985B)
----RemoveDuplicatesfromSortedArray.cpp(590B)
----RestoreIPAddresses.cpp(1KB)
----3Sum.cpp(1KB)
----NQueensII.cpp(737B)
----PopulatingNextRightPointersinEachNode.cpp(1KB)
----Combinations.cpp(706B)
----BinaryTreePostorderTraversal.cpp(975B)
----SumRoottoLeaveNumbers.cpp(959B)
----BinaryTreeInorderTraversal.cpp(1KB)
----DecodeWays.cpp(758B)
----PartitionList.cpp(1KB)
----ImplementstrStr.cpp(434B)
----LetterCombinationsofaPhoneNumber.cpp(1011B)
----RemoveDuplicatesfromSortedListII.cpp(849B)
----LRUCache.cpp(2KB)
----ConstructBinaryTreefromPostorderandInorderTraversal.cpp(1KB)
----WordSearch.cpp(2KB)
----ValidPalindrome.cpp(1KB)
----WordLadder.cpp(1KB)
----Sqrt.cpp(347B)
----SearchforaRange.cpp(758B)
----SetMatrixZeroes.cpp(799B)
----InsertInterval.cpp(1KB)
----AddTwoNumbers.cpp(994B)
----MultiplyStrings.cpp(1KB)
----LongestConsecutiveSequence.cpp(888B)
----MergeIntervals.cpp(924B)
----BinaryTreeZigzagLevelOrderTraversal.cpp(1KB)
----ValidNumber.cpp(2KB)