代码之美

找到所有数组中消失的数字（simple难度）https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { for (int i = 0; i < nums.length; i++) { i

最大子序和（simple难度）https://leetcode-cn.com/problems/maximum-subarray/与本题相同的题目：剑指offer42.连续子数组的最大和<方法一>：分治算法class Solution { public class Status { public int lSum, rSum, mSum, iSum; public Status(int lSum, int rSu

除自身以外数组的乘积（medium难度）https://leetcode-cn.com/problems/product-of-array-except-self/与本题相同的题目：剑指offer66.构建乘积数组<方法一>：左右乘积列表左右乘积列表实现过程：class Solution { public int[] productExceptSelf(int[] nums) { int length = n.

和为K的子数组（medium难度）https://leetcode-cn.com/problems/subarray-sum-equals-k/<方法一>：枚举public class Solution { public int subarraySum(int[] nums, int k) { int count = 0; for (int start = 0; start < nums.length; ++start) {

寻找重复数（medium难度）https://leetcode-cn.com/problems/find-the-duplicate-number/<方法一>:二分查找本方法代码和思路来源：作者：liweiwei1419链接：https://leetcode-cn.com/problems/find-the-duplicate-number/solution/er-fen-fa-si-lu-ji-dai-ma-python-by-liweiwei1419/来源：力扣（L

找到字符串中所有字母异位词（medium难度）https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/<方法>：滑动窗口+左右索引指针本方法代码和思路来源：作者：Jasion_han链接：https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/solution/20200321438median-by-jasion_han-r/来源

每日温度（medium难度）https://leetcode-cn.com/problems/daily-temperatures/class Solution { public int[] dailyTemperatures(int[] T) { int length = T.length; int[] ans = new int[length]; Deque<Integer> stack = new Linke

两数之和（simple难度）https://leetcode-cn.com/problems/two-sum/class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> hashtable = new HashMap<Integer, Integer>(); for (int i = 0; i < nums.le

字母异位词分组（medium难度）https://leetcode-cn.com/problems/group-anagrams/class Solution { public List<List<String>> groupAnagrams(String[] strs) { Map<String, List<String>> map = new HashMap<String, List<String&

字母异位词分组（medium难度）https://leetcode-cn.com/problems/group-anagrams/class Solution { public List<List<String>> groupAnagrams(String[] strs) { Map<String, List<String>> map = new HashMap<String, List<String&

爬楼梯（simple难度）https://leetcode-cn.com/problems/climbing-stairs/与本题相似题目：剑指offer10-Ⅱ.青蛙跳台阶问题class Solution { public int climbStairs(int n) { int p = 0, q = 0, r = 1; for (int i = 1; i <= n; ++i) { p = q;

移动零（simple难度）https://leetcode-cn.com/problems/move-zeroes/<方法一>解题思路使用双指针，左指针指向当前已经处理好的序列的尾部，右指针指向待处理序列的头部。右指针不断向右移动，每次右指针指向非零数，则将左右指针对应的数交换，同时左指针右移。注意到以下性质：左指针左边均为非零数； 右指针左边直到左指针处均为零。因此每次交换，都是将左指针的零与右指针的非零数交换，且非零数的相对顺序并未改变。class

多数元素（simple难度）https://leetcode-cn.com/problems/majority-element/与本题相同题目：剑指offer39. 数组中出现次数超过一半的数字本文思路及解法参考了《剑指offer39.数组中出现次数超过一半的数字》的题解作者：jyd链接：https://leetcode-cn.com/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/soluti

本文整理自LeetCode高赞题解作者：Time-Limit链接：https://leetcode-cn.com/problems/linked-list-cycle/solution/yi-wen-gao-ding-chang-jian-de-lian-biao-wen-ti-h-2/来源：力扣（LeetCode）

回文链表（simple难度）https://leetcode-cn.com/problems/palindrome-linked-list/class Solution { public boolean isPalindrome(ListNode head) { List<Integer> vals = new ArrayList<Integer>(); // 将链表的值复制到数组中 ListNode c

反转链表（simple难度）https://leetcode-cn.com/problems/reverse-linked-list/与本题相同的题目：剑指offer24.反转链表本题思路及代码实现：作者：wang_ni_ma链接：https://leetcode-cn.com/problems/reverse-linked-list/solution/dong-hua-yan-shi-206-来源：力扣（LeetCode）class Solution

反转链表（simple难度）https://leetcode-cn.com/problems/reverse-linked-list/与本题相同的题目：剑指offer24.反转链表本题思路及代码实现：作者：wang_ni_ma链接：https://leetcode-cn.com/problems/reverse-linked-list/solution/dong-hua-yan-shi-206-来源：力扣（LeetCode）class Solution

有效的括号（simple难度）https://leetcode-cn.com/problems/valid-parentheses/本文思路及代码来源作者：jyd链接：https://leetcode-cn.com/problems/valid-parentheses/solution/valid-parentheses-fu-zhu-zhan-fa-by-jin407891080/来源：力扣（LeetCode）<方法一>：哈希表+辅助栈：clas

对称二叉树（simple难度）https://leetcode-cn.com/problems/symmetric-tree/与本题相同题目:剑指offer28.对称的二叉树本文思路及解法参考了《剑指offer28.对称的二叉树》的题解作者：jyd链接：https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof/solution/mian-shi-ti-28-dui-cheng-de-er-cha-shu-di-gui-

只出现一次的数字（simple难度）https://leetcode-cn.com/problems/single-number/class Solution { public int singleNumber(int[] nums) { int single = 0; for (int num : nums) { single ^= num; } return single; }