Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
clumsy-factorial.py 939 Bytes
一键复制 编辑 原始数据 按行查看 历史
kamyu 提交于 2019-03-10 17:36 +08:00 . Update clumsy-factorial.py
# Time: O(1)
# Space: O(1)
# observation:
# i*(i-1)/(i-2) = i+1+2/(i-2)
# if i = 3 => i*(i-1)/(i-2) = i + 3
# if i = 4 => i*(i-1)/(i-2) = i + 2
# if i >= 5 => i*(i-1)/(i-2) = i + 1
#
# clumsy(N):
# if N = 1 => N
# if N = 2 => N
# if N = 3 => N + 3
# if N = 4 => N + 2 + 1 = N + 3
# if N > 4 and N % 4 == 1 => N + 1 + (... = 0) + 2 - 1 = N + 2
# if N > 4 and N % 4 == 2 => N + 1 + (... = 0) + 3 - 2 * 1 = N + 2
# if N > 4 and N % 4 == 3 => N + 1 + (... = 0) + 4 - 3 * 2 / 1 = N - 1
# if N > 4 and N % 4 == 0 => N + 1 + (... = 0) + 5 - (4*3/2) + 1 = N + 1
class Solution(object):
def clumsy(self, N):
"""
:type N: int
:rtype: int
"""
if N <= 2:
return N
if N <= 4:
return N+3
if N % 4 == 0:
return N+1
elif N % 4 <= 2:
return N+2
return N-1
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助