Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: add solutions to lc problems: No.0043,0415 #2141

Merged
merged 1 commit into from
Dec 22, 2023
Merged

feat: add solutions to lc problems: No.0043,0415 #2141

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
148 changes: 76 additions & 72 deletions solution/0000-0099/0043.Multiply Strings/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -149,97 +149,60 @@ public:

```go
func multiply(num1 string, num2 string) string {
if num1 == "0" || num2 == "0" {
return "0"
}
m, n := len(num1), len(num2)
res := make([]int, m+n)
mul := func(b, i int) {
for j, t := m-1, 0; j >= 0 || t > 0; i, j = i+1, j-1 {
if j >= 0 {
a := int(num1[j] - '0')
t += a * b
}
res[i] += t % 10
if res[i] >= 10 {
res[i] %= 10
res[i+1]++
}
t /= 10
arr := make([]int, m+n)
for i := m - 1; i >= 0; i-- {
a := int(num1[i] - '0')
for j := n - 1; j >= 0; j-- {
b := int(num2[j] - '0')
arr[i+j+1] += a * b
}
}
for i := 0; i < n; i++ {
b := num2[n-1-i] - '0'
mul(int(b), i)
}
var ans []byte
for _, v := range res {
ans = append(ans, byte(v+'0'))
for i := len(arr) - 1; i > 0; i-- {
arr[i-1] += arr[i] / 10
arr[i] %= 10
}
for len(ans) > 1 && ans[len(ans)-1] == '0' {
ans = ans[:len(ans)-1]
i := 0
if arr[0] == 0 {
i = 1
}
for i, j := 0, len(ans)-1; i < j; i, j = i+1, j-1 {
ans[i], ans[j] = ans[j], ans[i]
ans := []byte{}
for ; i < len(arr); i++ {
ans = append(ans, byte('0'+arr[i]))
}
return string(ans)
}
```

### **TypeScript**

```ts
function multiply(num1: string, num2: string): string {
if ([num1, num2].includes('0')) return '0';
const n1 = num1.length,
n2 = num2.length;
let ans = '';
for (let i = 0; i < n1; i++) {
let cur1 = parseInt(num1.charAt(n1 - i - 1), 10);
let sum = '';
for (let j = 0; j < n2; j++) {
let cur2 = parseInt(num2.charAt(n2 - j - 1), 10);
sum = addString(sum, cur1 * cur2 + '0'.repeat(j));
}
ans = addString(ans, sum + '0'.repeat(i));
}
return ans;
}

function addString(s1: string, s2: string): string {
const n1 = s1.length,
n2 = s2.length;
let ans = [];
let sum = 0;
for (let i = 0; i < n1 || i < n2 || sum > 0; i++) {
let num1 = i < n1 ? parseInt(s1.charAt(n1 - i - 1), 10) : 0;
let num2 = i < n2 ? parseInt(s2.charAt(n2 - i - 1), 10) : 0;
sum += num1 + num2;
ans.unshift(sum % 10);
sum = Math.floor(sum / 10);
}
return ans.join('');
}
```

```ts
function multiply(num1: string, num2: string): string {
if (num1 === '0' || num2 === '0') {
return '0';
}

const n = num1.length;
const m = num2.length;
const res = [];
for (let i = 0; i < n; i++) {
const a = Number(num1[n - i - 1]);
let sum = 0;
for (let j = 0; j < m || sum !== 0; j++) {
const b = Number(num2[m - j - 1] ?? 0);
sum += a * b + (res[i + j] ?? 0);
res[i + j] = sum % 10;
sum = Math.floor(sum / 10);
const m: number = num1.length;
const n: number = num2.length;
const arr: number[] = Array(m + n).fill(0);
for (let i: number = m - 1; i >= 0; i--) {
const a: number = +num1[i];
for (let j: number = n - 1; j >= 0; j--) {
const b: number = +num2[j];
arr[i + j + 1] += a * b;
}
}

return res.reverse().join('');
for (let i: number = arr.length - 1; i > 0; i--) {
arr[i - 1] += Math.floor(arr[i] / 10);
arr[i] %= 10;
}
let i: number = 0;
while (i < arr.length && arr[i] === 0) {
i++;
}
return arr.slice(i).join('');
}
```

Expand Down Expand Up @@ -277,6 +240,47 @@ impl Solution {
}
```

### **C#**

```cs
public class Solution {
public string Multiply(string num1, string num2) {
if (num1 == "0" || num2 == "0") {
return "0";
}

int m = num1.Length;
int n = num2.Length;
int[] arr = new int[m + n];

for (int i = m - 1; i >= 0; i--) {
int a = num1[i] - '0';
for (int j = n - 1; j >= 0; j--) {
int b = num2[j] - '0';
arr[i + j + 1] += a * b;
}
}

for (int i = arr.Length - 1; i > 0; i--) {
arr[i - 1] += arr[i] / 10;
arr[i] %= 10;
}

int index = 0;
while (index < arr.Length && arr[index] == 0) {
index++;
}

StringBuilder ans = new StringBuilder();
for (; index < arr.Length; index++) {
ans.Append(arr[index]);
}

return ans.ToString();
}
}
```

### **...**

```
Expand Down
106 changes: 58 additions & 48 deletions solution/0000-0099/0043.Multiply Strings/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -164,61 +164,30 @@ func multiply(num1 string, num2 string) string {

### **TypeScript**

```ts
function multiply(num1: string, num2: string): string {
if ([num1, num2].includes('0')) return '0';
const n1 = num1.length,
n2 = num2.length;
let ans = '';
for (let i = 0; i < n1; i++) {
let cur1 = parseInt(num1.charAt(n1 - i - 1), 10);
let sum = '';
for (let j = 0; j < n2; j++) {
let cur2 = parseInt(num2.charAt(n2 - j - 1), 10);
sum = addString(sum, cur1 * cur2 + '0'.repeat(j));
}
ans = addString(ans, sum + '0'.repeat(i));
}
return ans;
}

function addString(s1: string, s2: string): string {
const n1 = s1.length,
n2 = s2.length;
let ans = [];
let sum = 0;
for (let i = 0; i < n1 || i < n2 || sum > 0; i++) {
let num1 = i < n1 ? parseInt(s1.charAt(n1 - i - 1), 10) : 0;
let num2 = i < n2 ? parseInt(s2.charAt(n2 - i - 1), 10) : 0;
sum += num1 + num2;
ans.unshift(sum % 10);
sum = Math.floor(sum / 10);
}
return ans.join('');
}
```

```ts
function multiply(num1: string, num2: string): string {
if (num1 === '0' || num2 === '0') {
return '0';
}

const n = num1.length;
const m = num2.length;
const res = [];
for (let i = 0; i < n; i++) {
const a = Number(num1[n - i - 1]);
let sum = 0;
for (let j = 0; j < m || sum !== 0; j++) {
const b = Number(num2[m - j - 1] ?? 0);
sum += a * b + (res[i + j] ?? 0);
res[i + j] = sum % 10;
sum = Math.floor(sum / 10);
const m: number = num1.length;
const n: number = num2.length;
const arr: number[] = Array(m + n).fill(0);
for (let i: number = m - 1; i >= 0; i--) {
const a: number = +num1[i];
for (let j: number = n - 1; j >= 0; j--) {
const b: number = +num2[j];
arr[i + j + 1] += a * b;
}
}

return res.reverse().join('');
for (let i: number = arr.length - 1; i > 0; i--) {
arr[i - 1] += Math.floor(arr[i] / 10);
arr[i] %= 10;
}
let i: number = 0;
while (i < arr.length && arr[i] === 0) {
i++;
}
return arr.slice(i).join('');
}
```

Expand Down Expand Up @@ -256,6 +225,47 @@ impl Solution {
}
```

### **C#**

```cs
public class Solution {
public string Multiply(string num1, string num2) {
if (num1 == "0" || num2 == "0") {
return "0";
}

int m = num1.Length;
int n = num2.Length;
int[] arr = new int[m + n];

for (int i = m - 1; i >= 0; i--) {
int a = num1[i] - '0';
for (int j = n - 1; j >= 0; j--) {
int b = num2[j] - '0';
arr[i + j + 1] += a * b;
}
}

for (int i = arr.Length - 1; i > 0; i--) {
arr[i - 1] += arr[i] / 10;
arr[i] %= 10;
}

int index = 0;
while (index < arr.Length && arr[index] == 0) {
index++;
}

StringBuilder ans = new StringBuilder();
for (; index < arr.Length; index++) {
ans.Append(arr[index]);
}

return ans.ToString();
}
}
```

### **...**

```
Expand Down
70 changes: 35 additions & 35 deletions solution/0000-0099/0043.Multiply Strings/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,36 +1,36 @@
using System.Text;

public class Solution {
public string Multiply(string num1, string num2) {
var digits = new int[num1.Length + num2.Length];
for (var i = 0; i < num1.Length; ++i)
{
for (var j = 0; j < num2.Length; ++j)
{
var digit1 = num1[num1.Length - i - 1] - '0';
var digit2 = num2[num2.Length - j - 1] - '0';
var product = digit1 * digit2;
digits[i + j] += product;
}
}

var carry = 0;
for (var i = 0; i < digits.Length; ++i)
{
digits[i] += carry;
carry = digits[i] / 10;
digits[i] %= 10;
}

var sb = new StringBuilder();
for (var i = digits.Length - 1; i >= 0; --i)
{
if (digits[i] > 0 || sb.Length > 0)
{
sb.Append((char)(digits[i] + '0'));
}
}
if (sb.Length == 0) sb.Append('0');
return sb.ToString();
}
public class Solution {
public string Multiply(string num1, string num2) {
if (num1 == "0" || num2 == "0") {
return "0";
}
int m = num1.Length;
int n = num2.Length;
int[] arr = new int[m + n];
for (int i = m - 1; i >= 0; i--) {
int a = num1[i] - '0';
for (int j = n - 1; j >= 0; j--) {
int b = num2[j] - '0';
arr[i + j + 1] += a * b;
}
}
for (int i = arr.Length - 1; i > 0; i--) {
arr[i - 1] += arr[i] / 10;
arr[i] %= 10;
}
int index = 0;
while (index < arr.Length && arr[index] == 0) {
index++;
}
StringBuilder ans = new StringBuilder();
for (; index < arr.Length; index++) {
ans.Append(arr[index]);
}
return ans.ToString();
}
}
Loading