LeetCode解题录-51~100

【LeetCode解题录-51~100】的更多相关文章

LeetCode解题录-51~100

[leetcode]51. N-QueensN皇后 Backtracking Hard [leetcode]52. N-Queens II N皇后 Backtracking Hard [leetcode]53. Maximum Subarray最大子数组和 Dynamic Programming Easy [leetcode]54. Spiral Matrix螺旋矩阵 Array Medium [leetcode]55. Jump Game青蛙跳(能否跳到终点) Greedy Medium…

LeetCode解题录-1~50

[leetcode]1. Two Sum两数之和 Two Pointers, HashMap Easy [leetcode]2. Add Two Numbers两数相加 Math, LinkedList Medium [leetcode]3. Longest Substring Without Repeating Characters无重复字母的最长子串 Sliding Window Medium [leetcode]4. Median of Two Sorted Arrays俩有序数组的中位数…

Leetcode解题思想总结篇：双指针

Leetcode解题思想总结篇:双指针 1概念双指针:快慢指针. 快指针在每一步走的步长要比慢指针一步走的步长要多.快指针通常的步速是慢指针的2倍. 在循环中的指针移动通常为: faster = faster.next.next; slower = slower.next; 2 应用 2.1. 用来判断链表是否有环以及寻找环入口 Linked List Cycle Linked List Cycle II 是否有环:快慢指针思想,注意循环条件:(fast != null) && (fas…

LeetCode解题报告:Linked List Cycle && Linked List Cycle II

LeetCode解题报告:Linked List Cycle && Linked List Cycle II 1题目 Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? Linked List Cycle II Given a linked list, return the node w…

LeetCode高频题目（100）汇总-Java实现

LeetCode高频题目(100)汇总-Java实现 LeetCode高频题目(100)汇总-Java实现目录第01-50题 [Leetcode-easy-1] Two Sum [Leetcode-easy-2] Add Two Numbers [Leetcode-easy-3] Longest Substring Without Repeating Characters [Leetcode-easy-5] Longest Palindromic Substring [Leetc…

leetcode解题报告（2）：Remove Duplicates from Sorted ArrayII

描述 Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3], Your function should return length = 5, and A is now [1,1,2,2,3] 解法一要解该题,只需要在上一题(leetcode解题报告(1):Remove Dupli…

LeetCode 热题 HOT 100（05，正则表达式匹配）

LeetCode 热题 HOT 100(05,正则表达式匹配) 不够优秀,发量尚多,千锤百炼,方可成佛. 算法的重要性不言而喻,无论你是研究者,还是最近比较火热的IT 打工人,都理应需要一定的算法能力,这也是面试的必备环节,算法功底的展示往往能让面试官眼前一亮,这也是在大多数竞争者中脱颖而出的重要影响因素. 然而往往大多数人比较注重自身的实操能力,着重于对功能的实现,却忽视了对算法能力的提高.有的时候采用不同的算法来解决同一个问题,运行效率相差还是挺大的,毕竟我们最终还是需要站在客户的角度思考问…