Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
valid-permutations-for-di-sequence.py 512 Bytes
一键复制 编辑 原始数据 按行查看 历史
Allen Liu 提交于 2018-10-12 01:33 +08:00 . remove sensitive question description
# Time: O(n^2)
# Space: O(n)
class Solution(object):
def numPermsDISequence(self, S):
"""
:type S: str
:rtype: int
"""
dp = [1]*(len(S)+1)
for c in S:
if c == "I":
dp = dp[:-1]
for i in xrange(1, len(dp)):
dp[i] += dp[i-1]
else:
dp = dp[1:]
for i in reversed(xrange(len(dp)-1)):
dp[i] += dp[i+1]
return dp[0] % (10**9+7)
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助