Sum—LeetCode-415 Add Strings
来源:互联网 发布:mac卸载程序脚本 编辑:程序博客网 时间:2024/06/05 20:45
题目描述:
Given two non-negative integers num1 andnum2 represented as string, return the sum ofnum1 and num2.
Note:
- The length of both num1 andnum2 is < 5100.
- Both num1 andnum2 contains only digits 0-9.
- Both num1 andnum2 does not contain any leading zero.
- You must not use any built-in BigInteger library orconvert the inputs to integer directly.
public String addStrings(String num1, String num2) { int len = Math.max(num1.length(), num2.length()); char ch[] = new char[len + 1]; int i = num1.length() - 1, j = num2.length() - 1; int c = 0, k = len; while(i >= 0 && j >= 0){ int tempI = num1.charAt(i) - '0'; int tempJ = num2.charAt(j) - '0'; int tempSum = tempI + tempJ + c; ch[k] = String.valueOf(tempSum % 10).charAt(0); c = tempSum / 10; --k; --i; --j; } while(i >= 0) { int tempI = num1.charAt(i) - '0'; int tempSum = tempI + c; ch[k] = String.valueOf(tempSum % 10).charAt(0); c = tempSum / 10; --k; --i; } while(j >= 0) { int tempJ = num2.charAt(j) - '0'; int tempSum = tempJ + c; ch[k] = String.valueOf(tempSum % 10).charAt(0); c = tempSum / 10; --k; --j; } int flag = 0; if(c != 0) { flag = 1; ch[0] = String.valueOf(c).charAt(0); } String tempStr = String.valueOf(ch); if(flag == 0) return tempStr.substring(1); else return tempStr; }
0 0
- Sum—LeetCode-415 Add Strings
- Leetcode 415 Add Strings
- LeetCode[415] Add Strings
- LeetCode #415: Add Strings
- 【leetcode】415 Add Strings
- Leetcode Add Strings 415
- leetcode-415-Add Strings
- [Leetcode] #415 Add Strings
- leetcode[415]:Add Strings
- LeetCode 415 Add Strings
- Leetcode 415 Add Strings
- LeetCode.415(43) Add Strings&&Multiply Strings
- [LeetCode 415] Add Strings(Python)
- LeetCode—415. Add Strings
- 【LeetCode】415 Add Strings (java实现)
- Leetcode-415. Add Strings
- LeetCode 415. Add Strings
- [LeetCode]--415. Add Strings
- 思维方法
- 用Python将list中的string转换为int
- 深度学习利器:TensorFlow实战
- 【CSS标签的嵌套规则】
- Palindrome subsequence
- Sum—LeetCode-415 Add Strings
- MySQL架构总览->查询执行流程->SQL解析顺序
- IntelliJ IDEA(Community版本)的下载、安装和WordCount的初步使用(本地模式和集群模式)
- Centos 7 打开端口及查询端口
- HDU 1671 Phone List Trie Tree
- linux-docker基础1
- 假设检验
- tensorflow解决问题的思路
- 简略初次操作mongo及相关命令(终端命令行)