1343. 两字符串和

1343. 两字符串和

 

给定两个仅含数字的字符串，你需要返回一个由各个位之和拼接的字符串

样例

示例1:

输入:

A = "99"

B = "111"

输出: "11010"

解释: 因为 9 + 1 = 10, 9 + 1 = 10, 0 + 1 = 1,连接之后的结果是 "11010"

示例2:

输入:

A = "2"

B = "321"

输出: "323"

解释: 因为 1 + 2 = 3, 2 + 0 = 2, 3 + 0 = 3,连接之后的结果是 "323"

注意事项

• A 和 B 是由数字组成的字符串

 

 

 

public class Solution {

    /**

     * @param A: a string

     * @param B: a string

     * @return: return the sum of two strings

     */

    public String SumofTwoStrings(String A, String B) {

         StringBuilder stringBuilder = new StringBuilder();

            int k;

            if (A.length() > B.length()) {

                k = A.length() - B.length();

                stringBuilder.append(A.substring(0,k));

                for (int i = k; i < A.length(); i++) {

                    stringBuilder.append(A.charAt(i) + B.charAt(i-k) - 96);

                }

            } else if (A.length() < B.length()) {

                k = B.length() - A.length();

                stringBuilder.append(B.substring(0,k));

                for (int i = k; i < B.length(); i++) {

                    stringBuilder.append(A.charAt(i-k) + B.charAt(i) - 96);

                }

            } else {

                for (int i = 0; i < A.length(); i++) {

                    stringBuilder.append(A.charAt(i) + B.charAt(i) - 96);

                }

            }

            return stringBuilder.toString();

    }

}