Skip to content

feat: update ts solution to lc problem: No.2231 #2613

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 1 commit into from
Apr 18, 2024
Merged

feat: update ts solution to lc problem: No.2231 #2613

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
14 changes: 7 additions & 7 deletions solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -156,10 +156,10 @@ func largestInteger(num int) int {

```ts
function largestInteger(num: number): number {
let arrs = String(num).split('').map(Number);
let odds = []; // 奇数
let evens = [];
for (let i of arrs) {
const arrs: number[] = String(num).split('').map(Number);
const odds: number[] = []; // 奇数
const evens: number[] = [];
for (const i of arrs) {
if ((i & 1) == 1) {
odds.push(i);
} else {
Expand All @@ -168,9 +168,9 @@ function largestInteger(num: number): number {
}
odds.sort((a, b) => a - b);
evens.sort((a, b) => a - b);
let ans = [];
for (let i of arrs) {
ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
const ans: number[] = [];
for (const i of arrs) {
ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
}
return Number(ans.join(''));
}
Expand Down
14 changes: 7 additions & 7 deletions solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -154,10 +154,10 @@ func largestInteger(num int) int {

```ts
function largestInteger(num: number): number {
let arrs = String(num).split('').map(Number);
let odds = []; // 奇数
let evens = [];
for (let i of arrs) {
const arrs: number[] = String(num).split('').map(Number);
const odds: number[] = []; // 奇数
const evens: number[] = [];
for (const i of arrs) {
if ((i & 1) == 1) {
odds.push(i);
} else {
Expand All @@ -166,9 +166,9 @@ function largestInteger(num: number): number {
}
odds.sort((a, b) => a - b);
evens.sort((a, b) => a - b);
let ans = [];
for (let i of arrs) {
ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
const ans: number[] = [];
for (const i of arrs) {
ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
}
return Number(ans.join(''));
}
Expand Down
14 changes: 7 additions & 7 deletions solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
function largestInteger(num: number): number {
let arrs = String(num).split('').map(Number);
let odds = []; // 奇数
let evens = [];
for (let i of arrs) {
const arrs: number[] = String(num).split('').map(Number);
const odds: number[] = []; // 奇数
const evens: number[] = [];
for (const i of arrs) {
if ((i & 1) == 1) {
odds.push(i);
} else {
Expand All @@ -11,9 +11,9 @@ function largestInteger(num: number): number {
}
odds.sort((a, b) => a - b);
evens.sort((a, b) => a - b);
let ans = [];
for (let i of arrs) {
ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
const ans: number[] = [];
for (const i of arrs) {
ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
}
return Number(ans.join(''));
}