[LeetCode306] Additive Number
来源:互联网 发布:js高级程序设计最新 编辑:程序博客网 时间:2024/06/05 08:41
Additive number is a string whose digits can form additive sequence.
A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.
For example:"112358"
is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8
.
1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
"199100199"
is also an additive number, the additive sequence is: 1, 99, 100, 199
.1 + 99 = 100, 99 + 100 = 199
Note: Numbers in the additive sequence cannot have leading zeros, so sequence 1, 2, 03
or 1, 02, 3
is invalid.
Given a string containing only digits '0'-'9'
, write a function to determine if it's an additive number.
Follow up:
How would you handle overflow for very large input integers?
brute force
public class Solution { public boolean isAdditiveNumber(String num) { int len = num.length(); if(len<=1) return false; for(int i=1;i<=len/2;i++) { for(int j=1;Math.max(i,j)<=len-i-j;j++) { if(isValid(i,j,num)) return true; } } return false; } public boolean isValid(int i, int j, String num) { if(num.charAt(i) == '0' && j>1) return false; if(num.charAt(0) == '0' && i>1) return false; Long x1 = Long.parseLong(num.substring(0,i)); Long x2 = Long.parseLong(num.substring(i,i+j)); String sum = ""; for(int k=i+j; k!=num.length();k+=sum.length()) { x2 = x2+ x1; x1 = x2 - x1; sum = x2.toString(); if(!num.startsWith(sum, k)) return false; } return true; }}
0 0
- [LeetCode306] Additive Number
- LeetCode306——Additive Number且看我是如何解决的
- Additive number
- Additive Number
- Additive Number
- Additive Number
- Additive Number | Leetcode
- [LeetCode]Additive Number
- leetcode 306 : Additive Number
- Additive Number-LeetCode
- [Leetcode]Additive Number
- Leetcode196: Additive Number
- Leetcode: Additive Number
- LeetCode Additive Number
- leetcode:Additive Number
- leetcode:Additive Number
- leetcode - Additive Number
- [leetcode] 306. Additive Number
- mybaits学习笔记(一)
- Activity两种启动方式
- mybaits学习总结
- Use Avahi as a library for Discovering mDNS Service
- css3学习笔记(一)
- [LeetCode306] Additive Number
- UVALive 6834Shopping (贪心)
- UVALive 6832Bit String Reordering (模拟)
- UVALive 6833Miscalculation (模拟)
- UVALive 6837There is No Alternative (MST + LCA)
- UVALive 6838Flipping Parentheses (线段树)
- UVALive 6840Sweet War (博弈dp)
- Angular JS 学习笔记四
- 电子或通信领域当前的主流技术及其社会需求调查