力扣题:数组的遍历-9.29

力扣题-9.29

[力扣刷题攻略] Re：从零开始的力扣刷题生活

力扣题1：485. 最大连续1的个数

解题思想：遍历数组，记录下当前的连续１个数和最大的连续１个数即可

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        temp_len = 0
        max_len = 0
        for i in range(len(nums)):
            if nums[i] ==1:
                temp_len = temp_len+1
            elif nums[i] == 0:
                max_len = max(max_len,temp_len)
                temp_len = 0
        max_len = max(max_len,temp_len)
        return max_len

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int　temp_len =0,max_len = 0;
        for(int i=0;i<nums.size();i++){
            if(nums[i]==1){
                temp_len++;
            }
            else{
                max_len = max(max_len,temp_len);
                temp_len=0;
            }
        }
        max_len = max(max_len,temp_len);
        return max_len;
    }
};

力扣题2：495. 提莫攻击

解题思想：理解题目意思即可

class Solution(object):
    def findPoisonedDuration(self, timeSeries, duration):
        """
        :type timeSeries: List[int]
        :type duration: int
        :rtype: int
        """
        end_time = 0
        total = 0
        for i in range(len(timeSeries)):
            if timeSeries[i]>=end_time:
                end_time = timeSeries[i]+duration
                total = total +duration
            else:
                total = total+ timeSeries[i]+duration-end_time
                end_time = timeSeries[i]+duration
        return total

class Solution {
public:
    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
        int　end_time =0,total=0;
        for(int i=0;i<timeSeries.size();i++){
            if(timeSeries[i]>=end_time){
                end_time = timeSeries[i]+duration;
                total = total+duration;
            }
            else{
                total=total+timeSeries[i]+duration-end_time;
                end_time = timeSeries[i]+duration;
            }
        }
        return total;
    }
};