本文学习目标或巩固的知识点
- 学习如何处理字符串类题目
- 巩固字符数组
提前说明:算法题目来自力扣、牛客等等途径
博主真实经历!一般大厂面试的做题时间也就10-30分钟左右,如果不经常练习或者没掌握技巧很容易栽倒到一些容易的题上面,等回头看只有空悲切!!!!掌握技巧和算法敏感度很重要!!!!!
43. 字符串相乘🟡
给定两个以字符串形式表示的非负整数 num1 和 num2,返回 num1 和 num2 的乘积,它们的乘积也表示为字符串形式。
注意:不能使用任何内置的 BigInteger 库或直接将输入转换为整数。
示例 1:
输入: num1 = "2", num2 = "3"
输出: "6"
示例 2:
输入: num1 = "123", num2 = "456"
输出: "56088"
提示:
1 <= num1.length, num2.length <= 200
num1 和 num2 只能由数字组成。
num1 和 num2 都不包含任何前导零,除了数字0本身。
通过题目可知
优化竖式
该算法是通过两数相乘时,乘数某位与被乘数某位相乘,与产生结果的位置的规律来完成。具体规律如下:
- 乘数 num1 位数为 M,被乘数 num2 位数为 N, num1 x num2 结果 res 最大总位数为 M+N
- num1[i] x num2[j] 的结果为 tmp(位数为两位,“0x”, “xy” 的形式),其第一位位于 res[i+j],第二位位于 res[i+j+1]。
题解
class Solution {
/**
* 计算形式
* num1
* x num2
* ------
* result
*/
public String multiply(String num1, String num2) {
if (num1.equals("0") || num2.equals("0")) {
return "0";
}
int m = num1.length(), n = num2.length();
int[] result = new int[m + n];
for (int i = m - 1; i >= 0; i--) {
for (int j = n - 1; j >= 0; j--) {
int mul = (num1.charAt(i) - '0') * (num2.charAt(j) - '0');
int sum = mul + result[i + j + 1]; // 当前位相乘的结果加上之前可能有的进位
result[i + j + 1] = sum % 10; // 当前位的结果
result[i + j] += sum / 10; // 进位
}
}
StringBuilder sb = new StringBuilder();
for (int k = 0; k < result.length; k++) {
if (sb.length() == 0 && result[k] == 0)
continue; // 跳过前面的0
sb.append(result[k]);
}
return sb.length() == 0 ? "0" : sb.toString();
}
}
带打印的题解🤺
class Solution {
/**
* 计算形式
* num1
* x num2
* ------
* result
*/
public String multiply(String num1, String num2) {
if (num1.equals("0") || num2.equals("0")) {
return "0";
}
int m = num1.length(), n = num2.length();
int[] result = new int[m + n];
// 打印原始输入
System.out.println("num1: " + num1 + ", num2: " + num2);
for (int i = m - 1; i >= 0; i--) {
for (int j = n - 1; j >= 0; j--) {
int mul = (num1.charAt(i) - '0') * (num2.charAt(j) - '0');
int sum = mul + result[i + j + 1]; // 当前位相乘的结果加上之前可能有的进位
result[i + j + 1] = sum % 10; // 当前位的结果
result[i + j] += sum / 10; // 进位
// 打印当前步骤的信息
System.out.printf("Multiplying %d * %d = %d, Adding to %d (Current Sum: %d), Setting %d, Carrying %d\n",
num1.charAt(i) - '0', num2.charAt(j) - '0', mul, result[i + j + 1], sum, sum % 10, sum / 10);
// 打印当前的 result 数组状态
System.out.println("Current result: " + Arrays.toString(result));
System.out.println("");
}
}
StringBuilder sb = new StringBuilder();
for (int k = 0; k < result.length; k++) {
if (sb.length() == 0 && result[k] == 0)
continue; // 跳过前面的0
sb.append(result[k]);
// 打印最终结果中的每一位
System.out.println("Appending " + result[k]);
}
return sb.length() == 0 ? "0" : sb.toString();
}
}
输入:
num1 = “123”
num2 =“456”
按步骤打印,思路清晰
num1: 123, num2: 456
Multiplying 3 * 6 = 18, Adding to 8 (Current Sum: 18), Setting 8, Carrying 1
Current result: [0, 0, 0, 0, 1, 8]
Multiplying 3 * 5 = 15, Adding to 6 (Current Sum: 16), Setting 6, Carrying 1
Current result: [0, 0, 0, 1, 6, 8]
Multiplying 3 * 4 = 12, Adding to 3 (Current Sum: 13), Setting 3, Carrying 1
Current result: [0, 0, 1, 3, 6, 8]
Multiplying 2 * 6 = 12, Adding to 8 (Current Sum: 18), Setting 8, Carrying 1
Current result: [0, 0, 1, 4, 8, 8]
Multiplying 2 * 5 = 10, Adding to 4 (Current Sum: 14), Setting 4, Carrying 1
Current result: [0, 0, 2, 4, 8, 8]
Multiplying 2 * 4 = 8, Adding to 0 (Current Sum: 10), Setting 0, Carrying 1
Current result: [0, 1, 0, 4, 8, 8]
Multiplying 1 * 6 = 6, Adding to 0 (Current Sum: 10), Setting 0, Carrying 1
Current result: [0, 1, 1, 0, 8, 8]
Multiplying 1 * 5 = 5, Adding to 6 (Current Sum: 6), Setting 6, Carrying 0
Current result: [0, 1, 6, 0, 8, 8]
Multiplying 1 * 4 = 4, Adding to 5 (Current Sum: 5), Setting 5, Carrying 0
Current result: [0, 5, 6, 0, 8, 8]
Appending 5
Appending 6
Appending 0
Appending 8
Appending 8