文件名称：lrucacheleetcode-leetcode-in-go:leetcode-in-go
文件大小：80KB
文件格式：ZIP
更新时间：2024-07-19 16:56:22
系统开源
lru缓存leetcode Go 中解决的一些 Leetcode 问题 大批 3sum-0015 买卖股票的最佳时机-0121 最多水的容器-0011 contains-duplicate-0217 find-minimum-in-rotated-sorted-array-0153 数组的乘积-除了-self-0238 从排序数组中删除重复项-0026 搜索旋转排序数组-0033 两个整数之和-0371 二和-0001 回溯 组合-和-0039 组合总和-ii-0040 电话号码的字母组合 0017 排列-0046 排列-ii-0047 子集-0078 子集-ii-0090 设计 lru-cache-0146 动态规划 爬楼梯-0070 coin-change-0322 coin-change-ii-0518 组合和-iv-0377 解码方式-0091 盗家贼-0198 盗家贼-ii-0213 jump-game-0055 最长公共子序列1143 最长公共子串 最长递增子序列0300 最大积子阵列0152 最大子阵列-0053 唯一路径-0062 word-break-0139 图形
【文件预览】：
leetcode-in-go-master
----Array()
--------contains-duplicate-0217()
--------3sum-0015()
--------remove-duplicates-from-sorted-array-0026()
--------sum-of-two-integers-0371()
--------search-in-rotated-sorted-array-0033()
--------two-sum-0001()
--------best-time-to-buy-and-sell-stock-0121()
--------product-of-array-except-self-0238()
--------container-with-most-water-0011()
--------find-minimum-in-rotated-sorted-array-0153()
----Math()
--------reverse-integer-0007()
----Backtracking()
--------subsets-0078()
--------permutations-0046()
--------letter-combinations-of-a-phone-number-0017()
--------subsets-ii-0090()
--------combination-sum-0039()
--------combination-sum-ii-0040()
--------permutations-ii-0047()
--------README.md(1KB)
----Dynamic-Programming()
--------longest-common-substring()
--------maximum-subarray-0053()
--------jump-game-0055()
--------combination-sum-iv-0377()
--------unique-paths-0062()
--------coin-change-0322()
--------longest-increasing-subsequence-0300()
--------longest-common-subsequence-1143()
--------maximum-product-subarray-0152()
--------coin-change-ii-0518()
--------climbing-stairs-0070()
--------house-robber-0198()
--------word-break-0139()
--------decode-ways-0091()
--------README.md(2KB)
--------house-robber-ii-0213()
----Heap()
--------top-k-frequent-elements-0347()
----Structures()
--------structures.go(142B)
----Matrix()
--------number-of-islands-0200()
--------set-matrix-zeroes-0073()
--------spiral-matrix-0054()
--------rotate-image-0048()
--------max-area-of-island-0695()
--------word-search-0079()
----Tree()
--------construct-binary-tree-from-preorder-and-inorder-traversal-0105()
--------invert-binary-tree-0226()
--------binary-tree-inorder-traversal-0094()
--------make-a-binary-search-tree()
--------subtree-of-another-tree-0572()
--------symmetric-tree-0101()
--------kth-smallest-element-in-a-bst-0230()
--------lowest-common-ancestor-of-a-binary-search-tree-0235()
--------same-tree-0100()
--------implement-trie-prefix-tree-0208()
--------maximum-depth-of-binary-tree-0104()
--------binary-tree-level-order-traversal-0102()
--------binary-tree-paths-0257()
--------validate-binary-search-tree-0098()
----.gitignore(16B)
----Linked-List()
--------linked-list-cycle-0141()
--------reorder-list-0143()
--------palindrome-linked-list-0234()
--------merge-two-sorted-lists-0021()
--------reverse-linked-list-0206()
--------remove-nth-node-from-end-of-list-0019()
----String()
--------longest-repeating-character-replacement-0424()
--------longest-palindromic-substring-0005()
--------valid-palindrome-0125()
--------group-anagrams-0049()
--------longest-substring-without-repeating-characters-0003()
--------palindromic-substrings-0647()
--------longest-common-prefix-0014()
--------valid-anagram-0242()
--------valid-parentheses-0020()
----Interval()
--------merge-intervals-0056()
--------non-overlapping-intervals-0435()
----go.sum(0B)
----Sort()
--------bubbleSort.go(233B)
--------quickSort.go(972B)
--------sort_test.go(704B)
--------heapSort.go(1KB)
--------selectSort.go(339B)
--------insertSort.go(333B)
--------mergeSort.go(730B)
----Design()
--------lru-cache-0146()
----README.md(2KB)
----Graph()
--------course-schedule-0207()
----go.mod(25B)