leetcode 306. Additive Number
来源:互联网 发布:悍将传世源码 编辑:程序博客网 时间:2024/05/29 16:48
class Solution(object): def isAdditiveNumber(self, num): """ :type num: str :rtype: bool """ n = len(num) for i in range(1,n,1): for j in range(i+1,n,1): a,b = num[:i], num[i:j] if a[0] == '0' and len(a) > 1: continue if b[0] == '0' and len(b) > 1: continue while j < n: c = str(int(a)+int(b)) if num[j:j+len(c)] != c: break j += len(c) a,b = b,c if j == n: return True return False
阅读全文
0 0
- [leetcode] 306. Additive Number
- [LeetCode]306. Additive Number
- LeetCode:306. Additive Number
- leetcode 306. Additive Number
- 306. Additive Number LeetCode
- LeetCode *** 306. Additive Number
- LeetCode 306. Additive Number
- [LeetCode]--306. Additive Number
- [leetcode] 306. Additive Number
- 【LeetCode】306. Additive Number
- leetcode 306. Additive Number
- [LeetCode]306. Additive Number
- LeetCode 306. Additive Number
- leetcode 306. Additive Number
- [leetcode]306. Additive Number
- leetcode 306. Additive Number
- (Java)LeetCode-306. Additive Number
- [leetcode] 306. Additive Number 解题报告
- ubuntu 12.04 下DHCP网络设置——链接外网(NAT模式)
- 4
- 使用Adapter设计模式打造一个流式布局FlowLayout
- Android中获得屏幕宽高的实用方法
- 抽象类和接口的区别
- leetcode 306. Additive Number
- 大型网站架构之分布式消息队列
- 包 package
- [Lintcode] 105. Copy List with Random Pointer
- 数据结构与算法常见笔试题
- 百练1321:棋盘问题
- Eclipse Oxygen创建第一个Hibernate 5程序
- 双向链表
- Android零基础入门第61节:滚动视图ScrollView