cjql
commented
3 years ago 283 https://leetcode.com/problems/move-zeroes/
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
count = 0
for i in range(len(nums)):
if nums[i] == 0:
count += 1
else:
if(count>0):
nums[nums[i-count](i],nums[i-count] =),nums[i]class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
temp,i = 0,0
lenth = len(nums)
while(temp<lenth):
if nums[i] == 0:
nums.remove(nums[i])
nums.append(0)
i -= 1
i = i+1
temp += 1896 https://leetcode.com/problems/monotonic-array/
class Solution:
def isMonotonic(self, A: List[int]) -> bool:
lenth = len(A)
verified_index = 0
delta = 0
for i in range(lenth-1):
if A[A[i+1](i] !=):
delta = A[-A[i+1](i])
verified_index = i
break
for k in range(verified_index+1,lenth-1):
if (A[k]-A[k+1])*delta<0:
return False
return True
1013 https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/
class Solution:
def canThreePartsEqualSum(self, A: List[int]) -> bool:
total = sum(A)
if total % 3 != 0: return False
count, cumsum, target = 0, 0, total // 3
for num in A:
cumsum += num
if cumsum == target:
cumsum = 0
count += 1
return count >= 3class Solution:
def canThreePartsEqualSum(self, A: List[int]) -> bool:
sumA = sum(A)
if sumA%3 != 0:
return False
avr = sumA//3
lenth = len(A)
sum1 = 0
sum2 = 0
i = 0
j = 0
for index in range(lenth):
sum1 += A[index]
if sum1 == avr:
i = index
break;
if i<lenth-1:
for index in range(i+1,lenth):
sum2 += A[index]
if sum2 == avr:
j = index
break;
if i<j<lenth-1:
return True
return False485 https://leetcode.com/problems/max-consecutive-ones/
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
max_consec,temp = 0,0
for num in nums:
if num != 0:
temp += 1
max_consec = max(max_consec,temp)
else:
temp=0
return(max_consec)https://leetcode.com/problems/n-repeated-element-in-size-2n-array/submissions/ https://leetcode.com/problems/unique-morse-code-words/solution/
笔记
二叉树前序
https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/45290/Python-solutions-(recursively-and-iteratively).