xiaoling_000666的博客

Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the

和上一个题很像，但是每个数字只能使用一次。class Solution(object): def combinationSum2(self, candidates, target): self.result=[] candidates.sort() start=0 val=[] self.backdate(ca...

利用递归的方式求得和为定值的数，如果目标值小于0，肯定不是解，就break。class Solution(object): def combinationSum(self, candidates, target): candidates = list(set(candidates)) sorted(candidates) self.resul...

count代表这个这个数一共有几个，利用count再加上这个位置的数，最终得到最后的结果class Solution(object): def countAndSay(self, n): string='1' while n>1: string=self.countStr(string) n=n-1 ...

数独游戏，用了dfs的深度优先树。25行和26行的else将该位置改为点，是在一次dfs中的，相当于在for循环中不断尝试c值中的赋值。如果所有的c值都不对的时候会进入27行的return false，然后再进入23行的赋值。class Solution(object): def solveSudoku(self, board): def isvaild(i,j): ...

利用set函数，查找某个元素是否在set中，更快class Solution(object): def isValidSudoku(self, board): s=set() list=board for i in range(9): for j in range(9): if list...

二分法找到target的位置，再判断前后的位置class Solution(object): def searchRange(self, nums, target): start=0 end=len(nums)-1 while start<=end and start>=0 and end<=len(nums)-1: ...

自己开始写的代码，不过因为要多判断一次第一个数字，所以感觉不是很整洁，不过也通过了。class Solution(object): def searchInsert(self, nums, target): start=0 end=len(nums) if target<=nums[0]: return 0 ...

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the a...

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible

先反序，在统计位数，取模是本位数，除十是进位的数。class Solution(object): def multiply(self, num1, num2): num1=num1[::-1] num2=num2[::-1] carry=0 sum='' arr=[0 for i in range(len(nu...