【贪心】加油站

 

134-加油站-medium。贪心

这道题是找起点，其实可以转化成无论从哪个地方出发都能找到这个起点，只要满足条件。loop over一遍，把出发不了的都筛掉（start = i+1）

class Solution:
    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
        if len(gas) != len(cost):
            return 0
        start = cur = diff = 0
        n = len(gas)
        for i in range(n):
            cur += gas[i] - cost[i]
            diff += gas[i] - cost[i]
            if diff < 0:
                start = i+1
                diff = 0
        return start if cur >= 0 else -1

135-分发糖果-hard。贪心

又是一道前向后向遍历的题。首先所有小朋友初始化的值是1，保证每个人至少一个糖果，然后从左往右遍历一遍保证每个数和左边/右边的数的相对关系，再从右往左刷一遍，至于前向后向是和左还是右对比都行，分好工即可，2次遍历就能保证对于i元素的糖果对应的左右关系满足给定的权重即可

其实第一轮的遍历可以不用加max比较，肯定是res[i-1]+1更大

class Solution:
    def candy(self, ratings: List[int]) -> int:
        if not ratings:
            return 0
        n = len(ratings)
        res = [1]*n
        for i in range(1, n):
            if ratings[i] > ratings[i-1]:
                res[i] = max(res[i], res[i-1]+1)
        for i in range(n-2, -1, -1):
            if ratings[i] > ratings[i+1]:
                res[i] = max(res[i], res[i+1]+1)
        return sum(res)