Skip to content

shenkh/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

259 Commits
cpp
cpp
 
 
g3doc
g3doc
 
 
.gitignore
.gitignore
 
 
0001. 两数之和 [Easy] [Two Sum].md
0001. 两数之和 [Easy] [Two Sum].md
 
 
0002. 两数相加 [Medium] [Add Two Numbers].md
0002. 两数相加 [Medium] [Add Two Numbers].md
 
 
0003. 无重复字符的最长子串 [Medium] [Longest Substring Without Repeating Characters].md
0003. 无重复字符的最长子串 [Medium] [Longest Substring Without Repeating Characters].md
 
 
0005. 最长回文子串 [Medium] [Longest Palindromic Substring].md
0005. 最长回文子串 [Medium] [Longest Palindromic Substring].md
 
 
0007. 整数反转 [Easy] [Reverse Integer].md
0007. 整数反转 [Easy] [Reverse Integer].md
 
 
0008. 字符串转换整数 (atoi) [Medium] [String to Integer (atoi)].md
0008. 字符串转换整数 (atoi) [Medium] [String to Integer (atoi)].md
 
 
0010. 正则表达式匹配 [Hard] [Regular Expression Matching].md
0010. 正则表达式匹配 [Hard] [Regular Expression Matching].md
 
 
0011. 盛最多水的容器 [Medium] [Container With Most Water].md
0011. 盛最多水的容器 [Medium] [Container With Most Water].md
 
 
0014. 最长公共前缀 [Easy] [Longest Common Prefix].md
0014. 最长公共前缀 [Easy] [Longest Common Prefix].md
 
 
0015. 三数之和 [Medium] [3Sum].md
0015. 三数之和 [Medium] [3Sum].md
 
 
0016. 最接近的三数之和 [Medium] [3Sum Closest].md
0016. 最接近的三数之和 [Medium] [3Sum Closest].md
 
 
0017. 电话号码的字母组合 [Medium] [Letter Combinations of a Phone Number].md
0017. 电话号码的字母组合 [Medium] [Letter Combinations of a Phone Number].md
 
 
0018. 四数之和 [Medium] [4Sum].md
0018. 四数之和 [Medium] [4Sum].md
 
 
0019. 删除链表的倒数第N个节点 [Medium] [Remove Nth Node From End of List].md
0019. 删除链表的倒数第N个节点 [Medium] [Remove Nth Node From End of List].md
 
 
0020. 有效的括号 [Easy] [Valid Parentheses].md
0020. 有效的括号 [Easy] [Valid Parentheses].md
 
 
0021. 合并两个有序链表 [Easy] [Merge Two Sorted Lists].md
0021. 合并两个有序链表 [Easy] [Merge Two Sorted Lists].md
 
 
0022. 括号生成 [Medium] [Generate Parentheses].md
0022. 括号生成 [Medium] [Generate Parentheses].md
 
 
0023. 合并K个升序链表 [Hard] [Merge k Sorted Lists].md
0023. 合并K个升序链表 [Hard] [Merge k Sorted Lists].md
 
 
0024. 两两交换链表中的节点 [Medium] [Swap Nodes in Pairs].md
0024. 两两交换链表中的节点 [Medium] [Swap Nodes in Pairs].md
 
 
0026. 删除排序数组中的重复项 [Easy] [Remove Duplicates from Sorted Array].md
0026. 删除排序数组中的重复项 [Easy] [Remove Duplicates from Sorted Array].md
 
 
0031. 下一个排列 [Medium] [Next Permutation].md
0031. 下一个排列 [Medium] [Next Permutation].md
 
 
0032. 最长有效括号 [Hard] [Longest Valid Parentheses].md
0032. 最长有效括号 [Hard] [Longest Valid Parentheses].md
 
 
0033. 搜索旋转排序数组 [Medium] [Search in Rotated Sorted Array].md
0033. 搜索旋转排序数组 [Medium] [Search in Rotated Sorted Array].md
 
 
0034. 在排序数组中查找元素的第一个和最后一个位置 [Medium] [Find First and Last Position of Element in Sorted Array].md
0034. 在排序数组中查找元素的第一个和最后一个位置 [Medium] [Find First and Last Position of Element in Sorted Array].md
 
 
0036. 有效的数独 [Medium] [Valid Sudoku].md
0036. 有效的数独 [Medium] [Valid Sudoku].md
 
 
0037. 解数独 [Hard] [Sudoku Solver].md
0037. 解数独 [Hard] [Sudoku Solver].md
 
 
0039. 组合总和 [Medium] [Combination Sum].md
0039. 组合总和 [Medium] [Combination Sum].md
 
 
0040. 组合总和 II [Medium] [Combination Sum II].md
0040. 组合总和 II [Medium] [Combination Sum II].md
 
 
0041. 缺失的第一个正数 [Hard] [First Missing Positive].md
0041. 缺失的第一个正数 [Hard] [First Missing Positive].md
 
 
0042. 接雨水 [Hard] [Trapping Rain Water].md
0042. 接雨水 [Hard] [Trapping Rain Water].md
 
 
0043. 字符串相乘 [Medium] [Multiply Strings].md
0043. 字符串相乘 [Medium] [Multiply Strings].md
 
 
0044. 通配符匹配 [Hard] [Wildcard Matching].md
0044. 通配符匹配 [Hard] [Wildcard Matching].md
 
 
0045. 跳跃游戏 II [Hard] [Jump Game II].md
0045. 跳跃游戏 II [Hard] [Jump Game II].md
 
 
0046. 全排列 [Medium] [Permutations].md
0046. 全排列 [Medium] [Permutations].md
 
 
0047. 全排列 II [Medium] [Permutations II].md
0047. 全排列 II [Medium] [Permutations II].md
 
 
0048. 旋转图像 [Medium] [Rotate Image].md
0048. 旋转图像 [Medium] [Rotate Image].md
 
 
0050. Pow(x, n) [Medium] [Pow(x, n)].md
0050. Pow(x, n) [Medium] [Pow(x, n)].md
 
 
0051. N 皇后 [Hard] [N-Queens].md
0051. N 皇后 [Hard] [N-Queens].md
 
 
0052. N皇后 II [Hard] [N-Queens II].md
0052. N皇后 II [Hard] [N-Queens II].md
 
 
0053. 最大子序和 [Easy] [Maximum Subarray].md
0053. 最大子序和 [Easy] [Maximum Subarray].md
 
 
0054. 螺旋矩阵 [Medium] [Spiral Matrix].md
0054. 螺旋矩阵 [Medium] [Spiral Matrix].md
 
 
0055. 跳跃游戏 [Medium] [Jump Game].md
0055. 跳跃游戏 [Medium] [Jump Game].md
 
 
0056. 合并区间 [Medium] [Merge Intervals].md
0056. 合并区间 [Medium] [Merge Intervals].md
 
 
0060. 排列序列 [Hard] [Permutation Sequence].md
0060. 排列序列 [Hard] [Permutation Sequence].md
 
 
0062. 不同路径 [Medium] [Unique Paths].md
0062. 不同路径 [Medium] [Unique Paths].md
 
 
0063. 不同路径 II [Medium] [Unique Paths II].md
0063. 不同路径 II [Medium] [Unique Paths II].md
 
 
0064. 最小路径和 [Medium] [Minimum Path Sum].md
0064. 最小路径和 [Medium] [Minimum Path Sum].md
 
 
0069. x 的平方根 [Easy] [Sqrt(x)].md
0069. x 的平方根 [Easy] [Sqrt(x)].md
 
 
0072. 编辑距离 [Hard] [Edit Distance].md
0072. 编辑距离 [Hard] [Edit Distance].md
 
 
0073. 矩阵置零 [Medium] [Set Matrix Zeroes].md
0073. 矩阵置零 [Medium] [Set Matrix Zeroes].md
 
 
0075. 颜色分类 [Medium] [Sort Colors].md
0075. 颜色分类 [Medium] [Sort Colors].md
 
 
0076. 最小覆盖子串 [Hard] [Minimum Window Substring].md
0076. 最小覆盖子串 [Hard] [Minimum Window Substring].md
 
 
0077. 组合 [Medium] [Combinations].md
0077. 组合 [Medium] [Combinations].md
 
 
0078. 子集 [Medium] [Subsets].md
0078. 子集 [Medium] [Subsets].md
 
 
0080. 删除排序数组中的重复项 II [Medium] [Remove Duplicates from Sorted Array II].md
0080. 删除排序数组中的重复项 II [Medium] [Remove Duplicates from Sorted Array II].md
 
 
0082. 删除排序链表中的重复元素 II [Medium] [Remove Duplicates from Sorted List II].md
0082. 删除排序链表中的重复元素 II [Medium] [Remove Duplicates from Sorted List II].md
 
 
0083. 删除排序链表中的重复元素 [Easy] [Remove Duplicates from Sorted List].md
0083. 删除排序链表中的重复元素 [Easy] [Remove Duplicates from Sorted List].md
 
 
0084. 柱状图中最大的矩形 [Hard] [Largest Rectangle in Histogram].md
0084. 柱状图中最大的矩形 [Hard] [Largest Rectangle in Histogram].md
 
 
0085. 最大矩形 [Hard] [Maximal Rectangle].md
0085. 最大矩形 [Hard] [Maximal Rectangle].md
 
 
0088. 合并两个有序数组 [Easy] [Merge Sorted Array].md
0088. 合并两个有序数组 [Easy] [Merge Sorted Array].md
 
 
0090. 子集 II [Medium] [Subsets II].md
0090. 子集 II [Medium] [Subsets II].md
 
 
0091. 解码方法 [Medium] [Decode Ways].md
0091. 解码方法 [Medium] [Decode Ways].md
 
 
0092. 反转链表 II [Medium] [Reverse Linked List II].md
0092. 反转链表 II [Medium] [Reverse Linked List II].md
 
 
0093. 复原IP地址 [Medium] [Restore IP Addresses].md
0093. 复原IP地址 [Medium] [Restore IP Addresses].md
 
 
0094. 二叉树的中序遍历 [Medium] [Binary Tree Inorder Traversal].md
0094. 二叉树的中序遍历 [Medium] [Binary Tree Inorder Traversal].md
 
 
0095. 不同的二叉搜索树 II [Medium] [Unique Binary Search Trees II].md
0095. 不同的二叉搜索树 II [Medium] [Unique Binary Search Trees II].md
 
 
0096. 不同的二叉搜索树 [Medium] [Unique Binary Search Trees].md
0096. 不同的二叉搜索树 [Medium] [Unique Binary Search Trees].md
 
 
0097. 交错字符串 [Hard] [Interleaving String].md
0097. 交错字符串 [Hard] [Interleaving String].md
 
 
0098. 验证二叉搜索树 [Medium] [Validate Binary Search Tree].md
0098. 验证二叉搜索树 [Medium] [Validate Binary Search Tree].md
 
 
0101. 对称二叉树 [Easy] [Symmetric Tree].md
0101. 对称二叉树 [Easy] [Symmetric Tree].md
 
 
0102. 二叉树的层序遍历 [Medium] [Binary Tree Level Order Traversal].md
0102. 二叉树的层序遍历 [Medium] [Binary Tree Level Order Traversal].md
 
 
0104. 二叉树的最大深度 [Easy] [Maximum Depth of Binary Tree].md
0104. 二叉树的最大深度 [Easy] [Maximum Depth of Binary Tree].md
 
 
0105. 从前序与中序遍历序列构造二叉树 [Medium] [Construct Binary Tree from Preorder and Inorder Traversal].md
0105. 从前序与中序遍历序列构造二叉树 [Medium] [Construct Binary Tree from Preorder and Inorder Traversal].md
 
 
0106. 从中序与后序遍历序列构造二叉树 [Medium] [Construct Binary Tree from Inorder and Postorder Traversal].md
0106. 从中序与后序遍历序列构造二叉树 [Medium] [Construct Binary Tree from Inorder and Postorder Traversal].md
 
 
0108. 将有序数组转换为二叉搜索树 [Easy] [Convert Sorted Array to Binary Search Tree].md
0108. 将有序数组转换为二叉搜索树 [Easy] [Convert Sorted Array to Binary Search Tree].md
 
 
0109. 有序链表转换二叉搜索树 [Medium] [Convert Sorted List to Binary Search Tree].md
0109. 有序链表转换二叉搜索树 [Medium] [Convert Sorted List to Binary Search Tree].md
 
 
0110. 平衡二叉树 [Easy] [Balanced Binary Tree].md
0110. 平衡二叉树 [Easy] [Balanced Binary Tree].md
 
 
0111. 二叉树的最小深度 [Easy] [Minimum Depth of Binary Tree].md
0111. 二叉树的最小深度 [Easy] [Minimum Depth of Binary Tree].md
 
 
0112. 路径总和 [Easy] [Path Sum].md
0112. 路径总和 [Easy] [Path Sum].md
 
 
0113. 路径总和 II [Medium] [Path Sum II].md
0113. 路径总和 II [Medium] [Path Sum II].md
 
 
0114. 二叉树展开为链表 [Medium] [Flatten Binary Tree to Linked List].md
0114. 二叉树展开为链表 [Medium] [Flatten Binary Tree to Linked List].md
 
 
0115. 不同的子序列 [Hard] [Distinct Subsequences].md
0115. 不同的子序列 [Hard] [Distinct Subsequences].md
 
 
0118. 杨辉三角 [Easy] [Pascal's Triangle].md
0118. 杨辉三角 [Easy] [Pascal's Triangle].md
 
 
0119. 杨辉三角 II [Easy] [Pascal's Triangle II].md
0119. 杨辉三角 II [Easy] [Pascal's Triangle II].md
 
 
0120. 三角形最小路径和 [Medium] [Triangle].md
0120. 三角形最小路径和 [Medium] [Triangle].md
 
 
0121. 买卖股票的最佳时机 [Easy] [Best Time to Buy and Sell Stock].md
0121. 买卖股票的最佳时机 [Easy] [Best Time to Buy and Sell Stock].md
 
 
0122. 买卖股票的最佳时机 II [Easy] [Best Time to Buy and Sell Stock II].md
0122. 买卖股票的最佳时机 II [Easy] [Best Time to Buy and Sell Stock II].md
 
 
0123. 买卖股票的最佳时机 III [Hard] [Best Time to Buy and Sell Stock III].md
0123. 买卖股票的最佳时机 III [Hard] [Best Time to Buy and Sell Stock III].md
 
 
0124. 二叉树中的最大路径和 [Hard] [Binary Tree Maximum Path Sum].md
0124. 二叉树中的最大路径和 [Hard] [Binary Tree Maximum Path Sum].md
 
 
0126. 单词接龙 II [Hard] [Word Ladder II].md
0126. 单词接龙 II [Hard] [Word Ladder II].md
 
 
0127. 单词接龙 [Medium] [Word Ladder].md
0127. 单词接龙 [Medium] [Word Ladder].md
 
 
0129. 求根节点到叶节点数字之和 [Medium] [Sum Root to Leaf Numbers].md
0129. 求根节点到叶节点数字之和 [Medium] [Sum Root to Leaf Numbers].md
 
 
0131. 分割回文串 [Medium] [Palindrome Partitioning].md
0131. 分割回文串 [Medium] [Palindrome Partitioning].md
 
 
0132. 分割回文串 II [Hard] [Palindrome Partitioning II].md
0132. 分割回文串 II [Hard] [Palindrome Partitioning II].md
 
 
0135. 分发糖果 [Hard] [Candy].md
0135. 分发糖果 [Hard] [Candy].md
 
 
0136. 只出现一次的数字 [Easy] [Single Number].md
0136. 只出现一次的数字 [Easy] [Single Number].md
 
 
0139. 单词拆分 [Medium] [Word Break].md
0139. 单词拆分 [Medium] [Word Break].md
 
 

Repository files navigation

leetcode

leetcode solution also available in CSDN.

All leetcode-en-cn problems link.

About

leetcode solution

Resources

Readme

License

MIT license
Activity

Stars

1 star

Watchers

0 watching

Forks

2 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages