题目一:
485. Max Consecutive Ones
题目描述:
Given a binary array, find the maximum number of consecutive 1s in this array.
Note:
- The input array will only contain
0
and1
. - The length of input array is a positive integer and will not exceed 10,000
测试样例:
Example 1:
Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
思路分析:
利用max保存目前最大连续1的数量,用count算连续1的数量。当遇到0时,判断是否更新max并重置count。
代码:
class Solution:
def findMaxConsecutiveOnes(self, nums):
max = 0
count = 0
for num in nums:
if num:
count = count + 1
else:
if count>max:
max = count
count = 0
if count > max:
max = count
return max
运行结果:
题目二:
283. Move Zeroes
题目描述:
Given an array nums
, write a function to move all 0
's to the end of it while maintaining the relative order of the non-zero elements.
For example, given nums = [0, 1, 0, 3, 12]
, after calling your function, nums
should be [1, 3, 12, 0, 0]
.
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
思路分析:
先计算列表中有count个0,然后将列表中的零删除,再补count个0到后面。
代码:
class Solution:
def moveZeroes(self, nums):
i=0
m = nums.count(0)
count = 0
while i<len(nums):
if count==m:
break
if nums[i]==0:
del nums[i]
count = count+1
else:
i = i+1
i = 0
while i<m:
nums.append(0)
i = i+1
运行结果: