leetcode1124

class Solution:
    def longestWPI(self, hours: 'List[int]') -> int:
        longest = 0
        hours = [0] + hours
        n = len(hours)
        for i in range(n):
            if i == 0:
                continue
            pre = hours[i-1]
            if pre > 8:
                continue
            act = 0
            neg = 0
            curlong = 0
            borderlong = 0
            begin,end = 1,n-1
            for j in range(i,n):
                if hours[j] > 8:
                    act += 1
                else:
                    neg += 1
                if act > neg:
                    borderlong = j - i + 1
                    if borderlong > longest:
                        longest = max(longest,borderlong)
                        begin = i
                        end = j
                        if end == n - 1:
                            return longest
                        else:
                            i = begin
                
        return longest

这道题目没太看懂，尝试了几次，只能做出TLE的解。

看了一下别人的方案，也没弄明白，这题很迷。

14%的Acceptance，我估计不少参赛的选手都遇到了障碍。

最近几期的leetcode周赛和双周赛，题目质量总体来说不是很好，有些题目简单的没有算法思想，有些题目又很怪很偏。

对于大神们来讲，“什么妖魔鬼怪什么美女画皮，什么刀山火海什么陷阱诡计”，都挡不住大神们的火眼金睛和如意棒。

对于像我这样的菜鸟，跟这样的妖题怪题难题动手，未能够建功立业,反误了卿卿性命。

降妖除魔的任务就交给大神们了，我等凡夫俗子，还是做好围观群众的本职工作吧。

class Solution:
    def longestWPI(self, hours: List[int]) -> int:
        res = score = 0
        seen = {}
        for i, h in enumerate(hours):
            score = score + 1 if h > 8 else score - 1
            if score > 0:
                res = i + 1
            seen.setdefault(score, i)
            if score - 1 in seen:
                res = max(res, i - seen[score - 1])
        return res

参考：https://leetcode.com/problems/longest-well-performing-interval/discuss/334565/JavaC%2B%2BPython-O(N)-Solution-Life-needs-996-and-669