- 博客(22)
- 收藏
- 关注
RSS订阅原创 2020/3/22 leetcode 排序数组--冒泡排序
class Solution: def bubble_sort(nums): for i in range(len(nums)-1): flag=False for j in range(len(nums)-i-1): if nums[j]>nums[j+1]: nums[j],nums[j+1]=nums[j+1],nums[j] flag=...
2020-03-31 06:54:08
177
1
原创 2020/3/31leetcode Pow(x, n)
class Solution: def myPow(self,x,n): def re_binarysearch(x,n): if n<1: return 1 count,sum=1,x while count*2<=n: count+=count sum*=sum return re_binarysearch(x,n-count...
2020-03-31 06:43:28
58
原创 2020/3/30 javascript(4) 验证码功能
效果图： <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Title</title> </head> <body> 请输入验证码： <input id="inputCod...
2020-03-30 01:22:00
109
原创 2020/3/29 leetcode ocean and land
class Solution: def maxDistance(self,grid): n=len(grid) steps=-1 queue=[(i,j) for i in range(n) for j in range(n) if grid[i][j]==1] if len(queue)==0 or len(queue)==n**2:return steps while l...
2020-03-29 18:19:19
85
原创 2020/3/28 Javascript(2)基础function用按钮实现累加（做完了好开心）
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>Title</title> <script> function recursiveAdd(start,end){ var sum=...
2020-03-28 01:55:52
214
原创 2020/3/27leetcode
class Solution: def hasFroupSizeX(self,deck): dic={} for num in deck: if num in dic: dic[num]+=1 else: dic[num]=1 times=[value for key,value in dic.items()] if min(times)<2:...
2020-03-28 00:13:32
98
原创 2020/3/26 leetcode
class Solution: def groupAnagram(self,strs): result_dict={} result_list=[] for each_str in strs: key="".join(sorted(each_str)) if key in result_dict.keys():result_dict[key].append(each_s...
2020-03-26 13:04:17
75
原创 2020/3/9leetcode_两字符串数字相乘
class Solution: def multiply(self,num1,num2): a=int(num1) res=0 bit=1 for num in reversed(num2): res+=int(num)*a*bit bit*=10 return...
2020-03-09 16:55:04
194
原创 2020/3/6leetcode
class Solution: def trap(self,height): if not height:return 0 n=len(height) left,right=0,n-1 maxleft,maxright=height[0],height[n-1] ans=0 while lef...
2020-03-06 18:21:07
78
原创 2020/3/5leetcode
class Solution: def firstMissingPositive(self,nums): if 1 not in nums: return 1 if n==1: return 2 for i in range(n): if nums[i]<=0 o...
2020-03-06 17:21:42
72
原创 2020/2/23 leetcode_search-insert-position
class Solution: def searchInsert(self,nums,target): high=len(nums)-1 if target<nums[0]: return 0 if target>nums[high]: return high+1 ...
2020-03-05 00:25:28
75
原创 2020/2/23leetcode
class Solution: def searchRange(self,nums,target): for i in range(len(nums)): if nums[i]==target: left_idx=i break else: ...
2020-03-04 10:24:43
67
原创 2020/3/4 leetcode _find-element
class Solution: def search(self,nums,target): low=0 high=len(nums)-1 if not nums: return -1 while low<high-1: mid=(low+high)//2 if nums[...
2020-03-04 10:08:04
103
原创 2020/3/3leetcode_dividend and divisor
class Solution: def divide(self,dividend,divisor): sig=True if dividend*divisor>0 else False dividend,divisor=abs(dividend),abs(divisor) count=0 while divisor&l...
2020-03-03 15:16:21
107
原创 2020/2/24leetcode_strstr
class Solution: def strStr(self,haystack,needle): lh=len(haystack) ln=len(needle) if ln==0: return 0 if lh==0 or lh<ln: return -1 ...
2020-03-02 14:35:37
79
原创 2020/2/28remove_element_leetcode
class Solution: def removeElement(self,nums,val): flag=0 for num in nums: if num!=val: nums[flag]=num flag+=1 return flag ...
2020-03-02 14:02:10
80
原创 2020/3/2 leetcode reomve duplicate from sorted array
class Solution: def removeDuplicates(self,nums) pre,cur=0,1 while cur<len(nums): if nums[pre]==nums[cur]: nums.pop(cur) else: ...
2020-03-02 13:28:06
51
原创 2020/2/29generate_parenthesis
```python class Solution(object): def generateParenthesis(self,n): def get_res(n,count,s): if n==0 and count ==0: res.append(s) return ...
2020-03-01 18:14:05
65
原创 2020/3/1mergetwolist
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人