力扣415.字符串相加--JAVA

谁拔了我的垂杨柳

已于 2024-07-26 20:02:44 修改

阅读量135

点赞数 3

文章标签： java leetcode 算法

于 2024-07-26 20:00:38 首次发布

本文链接：https://blog.csdn.net/2303_77810717/article/details/140723801

版权

题目
请添加图片描述

方法一

class Solution {
    public String addStrings(String num1, String num2) {
        StringBuilder sb = new StringBuilder();
        int i = num1.length() - 1;
        int j = num2.length() - 1;
        int flag = 0;
        while (i >= 0 || j >= 0 || flag != 0) {
            int a = i < 0 ? 0 : num1.charAt(i--) - '0';
            int b = j < 0 ? 0 : num2.charAt(j--) - '0';
            int sum = a + b + flag;
            sb.append(sum % 10);
            flag = sum / 10;
        }
        return sb.reverse().toString();
    }
}

方法二

class Solution {
    public String addStrings(String num1, String num2) {
        int m = num1.length();
        int n = num2.length();
        int len = Math.max(m, n);
        String[] strings = new String[len + 1];
        int num = 0;
        int i = m - 1;
        int j = n - 1;
        int ct = 0;
        while (i >= 0 || j >= 0) {
            int x = 0;
            int y = 0;
            if (i >= 0) {
                x = num1.charAt(i) - '0';
            }
            if (j >= 0) {
                y = num2.charAt(j) - '0';
            }
            strings[num++] = String.valueOf((x + y + ct) % 10);
            ct = (x + y + ct) / 10;
            i--;
            j--;
        }
        if (ct != 0) {
            strings[num++] = String.valueOf(ct);
        }
        StringBuilder s = new StringBuilder();
        for (int k = num - 1; k >= 0; k--) {
            s.append(strings[k]);
        }
        return s.toString();
    }
}

方法三

class Solution {
        public static String addStrings(String num1, String num2) {
        int index1 = num1.length() - 1;
        int index2 = num2.length() - 1;
        StringBuilder sb = new StringBuilder();
        int sum = 0;
        while (index1 >= 0 || index2 >= 0 || sum != 0) {
            int n1 = index1 >= 0 ? num1.charAt(index1) - '0' : 0;
            int n2 = index2 >= 0 ? num2.charAt(index2) - '0' : 0;
            sum += n1 + n2;
            sb.insert(0, sum % 10);
            sum /= 10;
            index1--;
            index2--;
        }
        return sb.toString();
    }
}