zoukankan      html  css  js  c++  java
  • leetcode-415. Add Strings

    415. Add Strings

    Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.

    Note:

    1. The length of both num1 and num2 is < 5100.
    2. Both num1 and num2 contains only digits 0-9.
    3. Both num1 and num2 does not contain any leading zero.
    4. You must not use any built-in BigInteger library or convert the inputs to integer directly.

    java代码:

    public class Solution {
        public String addStrings(String num1, String num2) {
            int len1=num1.length()-1;
            int len2=num2.length()-1;
            StringBuilder sb=new StringBuilder();
            int sum=0,carry=0;
            while(len1>=0||len2>=0){
                int a=len1>=0?num1.charAt(len1)-'0':0;
                int b=len2>=0?num2.charAt(len2)-'0':0;
                sum=a+b+carry;
                if(sum>9){
                    sb.insert(0,sum%10);
                    carry=1;
                    sum=0;
                }else{
                    sb.insert(0,sum);
                    sum=0;
                    carry=0;
                }
                len1--;
                len2--;
            }
            if(carry==1){
                sb.insert(0,1);
            }
            return sb.toString();
        }
    }
    

      

  • 相关阅读:
    为用户添加角色
    WCF、MongoDB
    文件分布式存储实现例程
    Redis的Replication(复制)
    Lucene热词显示并选择
    Lucene热词统计
    通过队列解决Lucene文件并发创建索引
    Lucene.net应用
    Lucene.net
    Redis
  • 原文地址:https://www.cnblogs.com/lcbg/p/6653054.html
Copyright © 2011-2022 走看看