Skip to content

feat: update ts solution to lc problem: No.2976 #3327

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

Merged
merged 5 commits into from
Sep 3, 2024
Merged

feat: update ts solution to lc problem: No.2976 #3327

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
f5d2c67
feat: update ts solution to lc problem: No.2976
rain84 Jul 27, 2024
1440ec4
feat: add js solution to lc problem: No.2976
rain84 Jul 27, 2024
95f20e6
style: format code and docs with prettier
rain84 Jul 27, 2024
cf45f89
Update README.md
yanglbme Sep 3, 2024
1726248
Update README_EN.md
yanglbme Sep 3, 2024
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
87 changes: 66 additions & 21 deletions solution/2900-2999/2976.Minimum Cost to Convert String I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,8 +53,8 @@ tags:
<strong>输入：</strong>source = "aaaa", target = "bbbb", original = ["a","c"], changed = ["c","b"], cost = [1,2]
<strong>输出：</strong>12
<strong>解释：</strong>要将字符 'a' 更改为 'b'：
- 将字符 'a' 更改为 'c'，成本为 1
- 将字符 'c' 更改为 'b'，成本为 2
- 将字符 'a' 更改为 'c'，成本为 1
- 将字符 'c' 更改为 'b'，成本为 2
产生的总成本是 1 + 2 = 3。
将所有 'a' 更改为 'b'，产生的总成本是 3 * 4 = 12 。
</pre>
Expand Down Expand Up @@ -276,39 +276,84 @@ function minimumCost(
changed: string[],
cost: number[],
): number {
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(Infinity));
for (let i = 0; i < 26; ++i) {
g[i][i] = 0;
}
for (let i = 0; i < original.length; ++i) {
let x: number = original[i].charCodeAt(0) - 'a'.charCodeAt(0);
let y: number = changed[i].charCodeAt(0) - 'a'.charCodeAt(0);
let z: number = cost[i];
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = (ch: string) => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}

let ans: number = 0;
let n: number = source.length;
let ans = 0;
for (let i = 0; i < n; ++i) {
let x: number = source.charCodeAt(i) - 'a'.charCodeAt(0);
let y: number = target.charCodeAt(i) - 'a'.charCodeAt(0);
if (x !== y) {
if (g[x][y] >= Infinity) {
return -1;
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
}
```

#### JavaScript

```js
/**
* @param {string} source
* @param {string} target
* @param {character[]} original
* @param {character[]} changed
* @param {number[]} cost
* @return {number}
*/
var minimumCost = function (source, target, original, changed, cost) {
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
ans += g[x][y];
}
}

let ans = 0;
for (let i = 0; i < n; ++i) {
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
}
};
```

<!-- tabs:end -->
Expand Down
83 changes: 64 additions & 19 deletions solution/2900-2999/2976.Minimum Cost to Convert String I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -268,39 +268,84 @@ function minimumCost(
changed: string[],
cost: number[],
): number {
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(Infinity));
for (let i = 0; i < 26; ++i) {
g[i][i] = 0;
}
for (let i = 0; i < original.length; ++i) {
let x: number = original[i].charCodeAt(0) - 'a'.charCodeAt(0);
let y: number = changed[i].charCodeAt(0) - 'a'.charCodeAt(0);
let z: number = cost[i];
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = (ch: string) => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}

let ans: number = 0;
let n: number = source.length;
let ans = 0;
for (let i = 0; i < n; ++i) {
let x: number = source.charCodeAt(i) - 'a'.charCodeAt(0);
let y: number = target.charCodeAt(i) - 'a'.charCodeAt(0);
if (x !== y) {
if (g[x][y] >= Infinity) {
return -1;
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
}
```

#### JavaScript

```js
/**
* @param {string} source
* @param {string} target
* @param {character[]} original
* @param {character[]} changed
* @param {number[]} cost
* @return {number}
*/
var minimumCost = function (source, target, original, changed, cost) {
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
ans += g[x][y];
}
}

let ans = 0;
for (let i = 0; i < n; ++i) {
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
}
};
```

<!-- tabs:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/2900-2999/2976.Minimum Cost to Convert String I/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
/**
* @param {string} source
* @param {string} target
* @param {character[]} original
* @param {character[]} changed
* @param {number[]} cost
* @return {number}
*/
var minimumCost = function (source, target, original, changed, cost) {
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}

let ans = 0;
for (let i = 0; i < n; ++i) {
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
};
39 changes: 19 additions & 20 deletions solution/2900-2999/2976.Minimum Cost to Convert String I/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,36 +5,35 @@ function minimumCost(
changed: string[],
cost: number[],
): number {
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(Infinity));
for (let i = 0; i < 26; ++i) {
g[i][i] = 0;
}
for (let i = 0; i < original.length; ++i) {
let x: number = original[i].charCodeAt(0) - 'a'.charCodeAt(0);
let y: number = changed[i].charCodeAt(0) - 'a'.charCodeAt(0);
let z: number = cost[i];
const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
const g: number[][] = Array.from({ length: 26 }, () => Array(26).fill(MAX));
const getIndex = (ch: string) => ch.charCodeAt(0) - 'a'.charCodeAt(0);

for (let i = 0; i < 26; ++i) g[i][i] = 0;
for (let i = 0; i < m; ++i) {
const x = getIndex(original[i]);
const y = getIndex(changed[i]);
const z = cost[i];
g[x][y] = Math.min(g[x][y], z);
}

for (let k = 0; k < 26; ++k) {
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
for (let j = 0; g[i][k] < MAX && j < 26; j++) {
if (g[k][j] < MAX) {
g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}

let ans: number = 0;
let n: number = source.length;
let ans = 0;
for (let i = 0; i < n; ++i) {
let x: number = source.charCodeAt(i) - 'a'.charCodeAt(0);
let y: number = target.charCodeAt(i) - 'a'.charCodeAt(0);
if (x !== y) {
if (g[x][y] >= Infinity) {
return -1;
}
ans += g[x][y];
}
const x = getIndex(source[i]);
const y = getIndex(target[i]);
if (x === y) continue;
if (g[x][y] === MAX) return -1;
ans += g[x][y];
}
return ans;
}
Loading