5.2 LeetCode
优质
小牛编辑
136浏览
2023-12-01
一、前言
LeetCode这部分内容的算法比较难,自己能力有限,刷的题目也比较少,这部分内容就面试及笔试出现的频率整理出一部分内容,熟悉相关解题方法,争取在笔试中能够AC。
整理内容主要包括以下几个部分:
- 数组
- 字符串
- 链表
- 动态规划
- 贪心算法
二、目录
- Dynamic Programming
- Distinct Subsequences
- Longest Common Subsequence
- Longest Increasing Subsequence
- Best Time to Buy and Sell Stock
- Maximum Subarray
- Maximum Product Subarray
- Longest Palindromic Substring
- BackPack
- Maximal Square
- Stone Game
- Array
- Partition Array
- Subarray Sum
- Plus One
- Palindrome Number
- Two Sum
- String
- Restore IP Addresses
- Rotate String
- Valid Palindrome
- Length of Last Word
- Linked List
- Remove Duplicates from Sorted List
- Partition List
- Merge Two Sorted Lists
- LRU Cache
- Remove Linked List Elements
- Greedy
- Jump Game
- Gas Station
- Candy