柚子的博客

LeetCode8-StringtoInteger

LeetCode18 - 4Sum

LeetCode24 - swap nodes in pairs

LeetCode25 - reverse nodes in k groups

LeetCode29 - Divide Two Integer

LeetCode30 - Substring with concatenation of all words

LeetCode 31 - next permutation

LeetNode 23 - merge k sorted lists

leetcode 36 - valid sudoku

Leetcode38 - count and say

一、Leetcode50——pow【注意点】   1、n的值可以为正，负，0   2、O(n)会TLE，使用递归时，一定要将中间步保存   3、有博文中提到，若n<0，可以令n=-n, x = 1/x，但需要对n取反后是否出界进行处理，以下代码可以避免这个问题【Python3代码】class Solution: def myPow(self,x,n): if n ==...

LeetCode 20 - Valid parentheses

LeetCode19 - remove nth node from end of list

LeetCode17 - letter combinations of a phone number

LeetCode9-Palindrome Number

LeetCode11-Container with most water

LeetCode10-Regular Expression Matching

LeetCode7-Integer Reverse

LeetCode第5题：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000

LeetCode6-Zigzag

LeetCode14 - Longest Common Prefix

LeetCode15 - 3Sum

LeetCode16 - 3Sum closest

一、最大和子数组问题——寻找子数组使得该子数组中元素的和最大【思路】    1、初始化left = 0, maxSum = 0, right = 0    2、计算nums[left, right]的元素和，若大于maxSum，则更新maxSum。另，若>0，则right++，表示继续向该子数组中添加元素，否则，另left= right +1 , right = left,表示当前子数组已经...