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.

代码实现

        public string AddStrings(string num1, string num2)
        {
            StringBuilder sb = new StringBuilder();
            int carryBit = 0; //carry bit 
            for (int i = num1.Length - 1, j = num2.Length - 1;
                i >= 0 || j >= 0 || carryBit == 1; i--, j--) //think: num1=3, num2=9
            {
                int x = i < 0 ? 0 : charToInt(num1[i]);
                int y = j < 0 ? 0 : charToInt(num2[j]);
                sb.Append((x + y + carryBit) % 10);
                carryBit = (x + y + carryBit) / 10;
            }
            char[] chars = sb.ToString().Reverse().ToArray();
            return new string(chars);
        }

        private int charToInt(char c)
        {
            return c - '0';
        }

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值