leetcode刷题日志
偶有梦境
未觉池塘春草梦,阶前梧叶已秋声
展开
-
服务器备忘
查看端口被监听 netstat –ntl杀死指定端口 sudo fuser -k -n tcp 80杀死指定用户 sudo killall -u 用户名查看进程对应文件 ps aux | grep 4874文件权限部分把文件拥有者赋给指定用户 sudo chown -R username filename (其中R可选,递归处理内部文件)查看文件夹访问权限 ......原创 2020-03-19 10:52:18 · 536 阅读 · 0 评论 -
917. 仅仅反转字母
class Solution: def reverseOnlyLetters(self, S: str) -> str: i=0 j=len(S)-1 result=[" "]*len(S) while(i<len(S) and j>=0): if(S[i].isalpha() and S[j].isalpha()): result[i]=S[j] .原创 2020-09-15 20:17:41 · 114 阅读 · 0 评论 -
88. 合并两个有序数组
class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: """ Do not return anything, modify nums1 in-place instead. """ i=0 j=0 t=0 ttt=m+n-1 while(.原创 2020-09-12 21:01:08 · 109 阅读 · 0 评论 -
216. 组合总和 III
class Solution: def combinationSum3(self, k: int, n: int) -> List[List[int]]: end=[] def dfs(k,n,l,i): if(sum(l)==n and len(l)==k): end.append(l.copy()) if(i>9 or len(l).原创 2020-09-11 09:16:59 · 112 阅读 · 0 评论 -
2020-09-10
class Solution: def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool: if n==0: return True if len(flowerbed)<=2: for i in flowerbed: if i==1 or n>1: return.原创 2020-09-10 20:18:06 · 78 阅读 · 0 评论 -
1550. 存在连续三个奇数的数组 (easy)
class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: isodd=0 for i in arr: if i%2 != 0: isodd+=1 if(isodd==3): return True else: .原创 2020-09-10 19:03:50 · 95 阅读 · 0 评论 -
628. 三个数的最大乘积 (EASY)
class Solution: def maximumProduct(self, nums: List[int]) -> int: nums.sort() if(nums[0]<0 and nums[1]<0): return nums[-1]*nums[-2]*nums[-3] if nums[-1]*nums[-2]*nums[-3]>nums[1]*nums[0]*nums[-1] else nums[1]*nu.原创 2020-09-10 18:58:43 · 87 阅读 · 0 评论 -
977. 有序数组的平方 (EASY)
class Solution: def sortedSquares(self, A: List[int]) -> List[int]: A=[num*num for num in A] A.sort() return A原创 2020-09-10 18:45:59 · 83 阅读 · 0 评论 -
面试题 17.10. 主要元素 (ESAY)
class Solution: def majorityElement(self, nums: List[int]) -> int: s = set(nums) for i in s: if(nums.count(i)>len(nums)/2): return i; return -1原创 2020-09-10 18:37:25 · 129 阅读 · 0 评论 -
39. 组合总和
class Solution: def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: end=[]; i=0; tmp=[]; def dfs(candidates, target,tmp,i): if sum(tmp)==target: end.原创 2020-09-10 09:11:11 · 96 阅读 · 0 评论 -
40. 组合总和 II
class Solution: def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]: candidates=sorted(candidates) end=[] def dfs(candidates,target,i,l): if(sum(l)==target): end.appen.原创 2020-09-10 09:10:08 · 75 阅读 · 0 评论 -
1576. 替换所有的问号
class Solution: def modifyString(self, s: str) -> str: while s.find('?')!=-1: t='a' tmp=ord(t) if len(s)==1: return 'a' if s.find('?')==0: while t==s[s.find('?'.原创 2020-09-08 11:08:21 · 146 阅读 · 0 评论 -
347. 前 K 个高频元素
class Solution {public: static bool cmp(pair<int,int> a,pair<int,int> b){ return a.second > b.second; } vector<int> topKFrequent(vector<int>& nums, int k) { map<int,int> m; for(int .原创 2020-09-07 16:35:57 · 90 阅读 · 0 评论