文件名称：lrucacheleetcode-leetcode-1:leetcode-1
文件大小：64KB
文件格式：ZIP
更新时间：2024-07-19 17:20:03
系统开源
lru cache leetcode Leetcode Solution 1. Two Sum 二重循环遍历 2. Add Two Numbers 链表求和，哨兵节点 3. Longest Substring Without Repeating Characters 最长没有重复字符的子序列 记录各字符最近一次出现的位置 4. Median of Two Sorted Arrays 求两有序数列的中位数，可泛化为求两有序数列的第k位数，二分法 5. Longest Palindromic Substring 最长回文子串，补符号，记忆 6. ZigZag Conversion 观察规律 7. Reverse Integer 翻转整数 8. String to Integer 解析字符串 9. Palindrome Number 回文数字 10. Regular Expression Matching 动态规划，列出转换方程即可，注意初值 记T[i][j] = 是否S[0:i]和P[0:j]匹配 再分类讨论，其中pattern *分为0, 1, more三种类型 0: i不变, j+1
【文件预览】：
leetcode-1-master
----0801-0900()
--------0874.Walking-Robot-Simulation.cpp(1KB)
----0101-0200()
--------0137.Single-Number2.cpp(435B)
--------0133.Clone-Graph.cpp(2KB)
--------0146.LRU-Cache.cpp(2KB)
--------0101.Symmetric-Tree.cpp(826B)
--------0123.Best-Time-to-Buy-and-Sell-Stock3.cpp(1KB)
--------0136.Single-Number.cpp(1KB)
--------0125.Valid-Palindrome.cpp(767B)
--------0155.Min-Stack.cpp(2KB)
--------0122.Best-Time-to-Buy-and-Sell-Stock2.cpp(408B)
--------0121.Best-Time-to-Buy-and-Sell-Stock.cpp(498B)
--------0110.Balanced-Binary-Tree.cpp(713B)
--------0198.House-Robber.cpp(377B)
----0901-1000()
--------0929.Unique-Email-Address.cpp(815B)
----archive.py(902B)
----common.h(3KB)
----0001-0100()
--------0014.Longest-Common-Prefix.cpp(600B)
--------0043.Multiply-Strings.cpp(2KB)
--------0094.Binary-Tree-Inorder-Traversal.cpp(929B)
--------0070.Climbing-Stairs.cpp(330B)
--------0037.Sudoku-Solver.cpp(4KB)
--------0053.Maximum-Subarray.cpp(434B)
--------0022.Generate-Parenthess.cpp(689B)
--------0098.Validate-Binary-Search-Tree.cpp(3KB)
--------0091.DecodeWays.cpp(687B)
--------0056.Merge-Intervals.cpp(1KB)
--------0018.4Sum.cpp(4KB)
--------0012.Integer-to-Roman.cpp(933B)
--------0004.Median-of-Two-Sorted-Arrays.cpp(1KB)
--------0005.Longest-Palindromic-Substring.cpp(1KB)
--------0023.Merge-K-Sorted-Lists.cpp(2KB)
--------0011.Container-With-Most-Water.cpp(1KB)
--------0063.Unique-Paths2.cpp(837B)
--------0024.Swap-Nodes-in-Pairs.cpp(712B)
--------0006.ZigZag-Conversion.cpp(661B)
--------0064.Minimum-Path-Sum.cpp(710B)
--------0036.Valid-Sudoku.cpp(1KB)
--------0069.Sqrt.cpp(446B)
--------0015.3Sum.cpp(4KB)
--------0021.Merge-Two-Sorted-Lists.cpp(1KB)
--------0088.Merge-Sorted-Array.cpp(1KB)
--------0013.Roman-to-Integer.cpp(2KB)
--------0027.Remove-Element.cpp(424B)
--------0050.Pow.cpp(1KB)
--------0016.3Sum-Closest.cpp(2KB)
--------0055.Jump-Game.cpp(464B)
--------0059.Spiral-Matrix2.cpp(721B)
--------0026.Remove-Duplicates-from-Sorted-Array.cpp(501B)
--------0041.First-Missing-Positive.cpp(531B)
--------0010.Regular-Expression-Matching.cpp(1KB)
--------0100.Same-Tree.cpp(908B)
--------0008.String-to-Integer.cpp(1KB)
--------0009.Palindrome-Number.cpp(382B)
--------0058.Length-of-Last-Word.cpp(382B)
--------0029.Divide-Two-Integers.cpp(1KB)
--------0062.Unique-Paths.cpp(392B)
--------0083.Remove-Duplicates-from-Sorted-List.cpp(587B)
--------0007.Reverse-Integer.cpp(491B)
--------0066.Plus-One.cpp(556B)
--------0067.Add-Binary.cpp(872B)
--------0017.Letter-Combinations-of-a-Phone-Number.cpp(1KB)
--------0019.Remove-Nth-Node-From-End-of-List.cpp(692B)
--------0002.Add-Two-Numbers.cpp(1KB)
--------0038.Count-and-Say.cpp(2KB)
--------0001.Two-Sum.cpp(523B)
--------0020.Valid-Parentheses.cpp(1KB)
--------0031.Next-Permutation.cpp(904B)
--------0003.Longest-Substring-Without-Repeating-Characters.cpp(595B)
--------0035.Search-Insert-Position.cpp(492B)
--------0039.Combination-Sum.cpp(2KB)
----basic()
--------interval_dp_removal_game.cpp(3KB)
--------hanoi_valid.cpp(1KB)
--------hanoi.cpp(2KB)
--------timeisoftheessence.cpp(4KB)
--------ieee()
--------bisearch.cpp(2KB)
----0301-0400()
--------0303.Range-Sum-Query-Immutable.cpp(614B)
----0201-0300()
--------0202.Happy-Number.cpp(2KB)
--------0283.Move-Zeros.cpp(363B)
--------0207.Course-Schedule.cpp(1KB)
--------0208.Implement-Trie.cpp(4KB)
----README.md(7KB)
----0701-0800()
--------0771.Jewels-and-Stones.cpp(416B)
--------0709.To-Lower-Case.cpp(371B)