渣滓般的存在

LeetCode 557. Reverse Words in a String IIIGiven a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1:

Spiral Matrix#coding=utf-8class Solution(object): def spiralOrder(self, matrix): """ :type matrix: List[List[int]] :rtype: List[int] """ res=[]

Combination Sum II#coding=utf-8class Solution(object): def combinationSum2(self, candidates, target): """ :type candidates: List[int] :type target: int :rtype

Wildcard Matching 看的大神的答案。当p[pPointer] == ‘?’ or p[pPointer] == s[sPointer]的时候，两个指针都向后移一位，当p[pPointer] == ‘*’的时候，用star记录下p当前的位置，pPointer向后移，ss记录s当前的位置，如果上面的条件都不满足了，看star是不是-1，不是的话，把pPointer拉回到star的下一

Count and Say这个题目的意思是n=1时输出字符串1；n=2时，数上次字符串中的数值个数，因为上次字符串有1个1，所以输出11；n=3时，由于上次字符是11，有2个1，所以输出21；n=4时，由于上次字符串是21，有1个2和1个1，所以输出1211。#coding=utf-8class Solution(object): def countAndSay(self,

Implement strStr()#coding=utf-8class Solution(object): def strStr(self, haystack, needle): """ :type haystack: str :type needle: str :rtype: int """

Swap Nodes in Pairs还是设置一个头结点比较好操作，直接操作不太顺利。。。class Solution(object): def swapPairs(self, head): """ :type head: ListNode :rtype: ListNode """ if head is None

Search Insert Position#coding=utf-8class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int

4Sum和3Sum差不多#coding=utf-8class Solution(object): def fourSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[List[int]] """

Longest Valid Parentheses昨天刚听了这道题的讲解，今天就做到了。。。有几个坑count存放的当前位置最长的有效子串，这个碰到的主要是当有效的子串到达了s[0]，要判断一下。#coding=utf-8class Solution(object): def longestValidParentheses(self, s): """ :ty

String to Integer (atoi)import reclass Solution(object): def myAtoi(self, str): INT_MAX=2147483647 INT_MIN=-2147483648 temp=0 if str=='': return 0

题目要求可以直接去leetcode搜 Longest Palindromic Substringclass Solution(object): def longestPalindrome(self,s): d={} d[-1]=s[0] if len(s)==1: return s for i in r

Permutations II 剪枝#coding=utf-8class Solution(object): def permuteUnique(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ if len(num