1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
odd-even-jump.py 911 Bytes
一键复制 编辑 原始数据 按行查看 历史
kamyu 提交于 6年前 . Create odd-even-jump.py
# Time: O(nlogn)
# Space: O(n)
class Solution(object):
def oddEvenJumps(self, A):
"""
:type A: List[int]
:rtype: int
"""
def findNext(idx):
result = [None]*len(idx)
stack = []
for i in idx:
while stack and stack[-1] < i:
result[stack.pop()] = i
stack.append(i)
return result
idx = sorted(range(len(A)), key = lambda i: A[i])
next_higher = findNext(idx)
idx.sort(key = lambda i: -A[i])
next_lower = findNext(idx)
odd, even = [False]*len(A), [False]*len(A)
odd[-1], even[-1] = True, True
for i in reversed(xrange(len(A)-1)):
if next_higher[i]:
odd[i] = even[next_higher[i]]
if next_lower[i]:
even[i] = odd[next_lower[i]]
return sum(odd)
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助