= votes[0].chars().collect();
+
+ s.sort_by(|&a, &b| {
+ let i = (a as u8 - b'A') as usize;
+ let j = (b as u8 - b'A') as usize;
+
+ for k in 0..m {
+ if cnt[i][k] != cnt[j][k] {
+ return cnt[j][k].cmp(&cnt[i][k]);
+ }
+ }
+ a.cmp(&b)
+ });
+
+ s.into_iter().collect()
+ }
}
```
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/README_EN.md b/solution/1300-1399/1366.Rank Teams by Votes/README_EN.md
index 3491240aa8fea..013d3cbd269f4 100644
--- a/solution/1300-1399/1366.Rank Teams by Votes/README_EN.md
+++ b/solution/1300-1399/1366.Rank Teams by Votes/README_EN.md
@@ -36,7 +36,7 @@ tags:
Input: votes = ["ABC","ACB","ABC","ACB","ACB"]
Output: "ACB"
-Explanation:
+Explanation:
Team A was ranked first place by 5 voters. No other team was voted as first place, so team A is the first team.
Team B was ranked second by 2 voters and ranked third by 3 voters.
Team C was ranked second by 3 voters and ranked third by 2 voters.
@@ -49,7 +49,7 @@ As most of the voters ranked C second, team C is the second team, and team B is
Input: votes = ["WXYZ","XYZW"]
Output: "XWYZ"
Explanation:
-X is the winner due to the tie-breaking rule. X has the same votes as W for the first position, but X has one vote in the second position, while W does not have any votes in the second position.
+X is the winner due to the tie-breaking rule. X has the same votes as W for the first position, but X has one vote in the second position, while W does not have any votes in the second position.
Example 3:
@@ -80,9 +80,9 @@ X is the winner due to the tie-breaking rule. X has the same votes as W for the
### Solution 1: Counting + Custom Sorting
-For each candidate, we can count the number of votes they receive in each ranking, and then compare the number of votes according to different rankings. If the number of votes is the same, we compare the letters.
+For each candidate, we can count the number of votes they receive at each rank, then compare the vote counts for different ranks in order. If the vote counts are the same, we compare the letters.
-The time complexity is $O(n^2 \times \log n)$, and the space complexity is $O(n^2)$. Where $n$ is the number of candidates.
+The time complexity is $O(n \times m + m^2 \times \log m)$, and the space complexity is $O(m^2)$. Here, $n$ is the length of $\textit{votes}$, and $m$ is the number of candidates, i.e., the length of $\textit{votes}[0]$.
@@ -91,12 +91,12 @@ The time complexity is $O(n^2 \times \log n)$, and the space complexity is $O(n^
```python
class Solution:
def rankTeams(self, votes: List[str]) -> str:
- n = len(votes[0])
- cnt = defaultdict(lambda: [0] * n)
+ m = len(votes[0])
+ cnt = defaultdict(lambda: [0] * m)
for vote in votes:
for i, c in enumerate(vote):
cnt[c][i] += 1
- return "".join(sorted(votes[0], key=lambda x: (cnt[x], -ord(x)), reverse=True))
+ return "".join(sorted(cnt, key=lambda c: (cnt[c], -ord(c)), reverse=True))
```
#### Java
@@ -104,29 +104,28 @@ class Solution:
```java
class Solution {
public String rankTeams(String[] votes) {
- int n = votes[0].length();
- int[][] cnt = new int[26][n];
+ int m = votes[0].length();
+ int[][] cnt = new int[26][m + 1];
for (var vote : votes) {
- for (int i = 0; i < n; ++i) {
- cnt[vote.charAt(i) - 'A'][i]++;
+ for (int i = 0; i < m; ++i) {
+ ++cnt[vote.charAt(i) - 'A'][i];
}
}
- Character[] cs = new Character[n];
- for (int i = 0; i < n; ++i) {
- cs[i] = votes[0].charAt(i);
+ Character[] s = new Character[m];
+ for (int i = 0; i < m; ++i) {
+ s[i] = votes[0].charAt(i);
}
- Arrays.sort(cs, (a, b) -> {
+ Arrays.sort(s, (a, b) -> {
int i = a - 'A', j = b - 'A';
- for (int k = 0; k < n; ++k) {
- int d = cnt[i][k] - cnt[j][k];
- if (d != 0) {
- return d > 0 ? -1 : 1;
+ for (int k = 0; k < m; ++k) {
+ if (cnt[i][k] != cnt[j][k]) {
+ return cnt[j][k] - cnt[i][k];
}
}
return a - b;
});
StringBuilder ans = new StringBuilder();
- for (char c : cs) {
+ for (var c : s) {
ans.append(c);
}
return ans.toString();
@@ -140,25 +139,25 @@ class Solution {
class Solution {
public:
string rankTeams(vector& votes) {
- int n = votes[0].size();
- int cnt[26][n];
- memset(cnt, 0, sizeof cnt);
- for (auto& vote : votes) {
- for (int i = 0; i < n; ++i) {
- cnt[vote[i] - 'A'][i]++;
+ int m = votes[0].size();
+ array, 26> cnt{};
+
+ for (const auto& vote : votes) {
+ for (int i = 0; i < m; ++i) {
+ ++cnt[vote[i] - 'A'][i];
}
}
- string ans = votes[0];
- sort(ans.begin(), ans.end(), [&](auto& a, auto& b) {
+ string s = votes[0];
+ ranges::sort(s, [&](char a, char b) {
int i = a - 'A', j = b - 'A';
- for (int k = 0; k < n; ++k) {
+ for (int k = 0; k < m; ++k) {
if (cnt[i][k] != cnt[j][k]) {
return cnt[i][k] > cnt[j][k];
}
}
return a < b;
});
- return ans;
+ return string(s.begin(), s.end());
}
};
```
@@ -167,24 +166,83 @@ public:
```go
func rankTeams(votes []string) string {
- cnt := [26][26]int{}
+ m := len(votes[0])
+ cnt := [26][27]int{}
for _, vote := range votes {
- for i, c := range vote {
- cnt[c-'A'][i]++
+ for i, ch := range vote {
+ cnt[ch-'A'][i]++
}
}
- ans := []byte(votes[0])
- sort.Slice(ans, func(i, j int) bool {
- cnt1, cnt2 := cnt[ans[i]-'A'], cnt[ans[j]-'A']
- for k, a := range cnt1 {
- b := cnt2[k]
- if a != b {
- return a > b
+ s := []rune(votes[0])
+ sort.Slice(s, func(i, j int) bool {
+ a, b := s[i]-'A', s[j]-'A'
+ for k := 0; k < m; k++ {
+ if cnt[a][k] != cnt[b][k] {
+ return cnt[a][k] > cnt[b][k]
}
}
- return ans[i] < ans[j]
+ return s[i] < s[j]
})
- return string(ans)
+ return string(s)
+}
+```
+
+#### TypeScript
+
+```ts
+function rankTeams(votes: string[]): string {
+ const m = votes[0].length;
+ const cnt: number[][] = Array.from({ length: 26 }, () => Array(m + 1).fill(0));
+ for (const vote of votes) {
+ for (let i = 0; i < m; i++) {
+ cnt[vote.charCodeAt(i) - 65][i]++;
+ }
+ }
+ const s: string[] = votes[0].split('');
+ s.sort((a, b) => {
+ const i = a.charCodeAt(0) - 65;
+ const j = b.charCodeAt(0) - 65;
+ for (let k = 0; k < m; k++) {
+ if (cnt[i][k] !== cnt[j][k]) {
+ return cnt[j][k] - cnt[i][k];
+ }
+ }
+ return a.localeCompare(b);
+ });
+ return s.join('');
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+ pub fn rank_teams(votes: Vec) -> String {
+ let m = votes[0].len();
+ let mut cnt = vec![vec![0; m + 1]; 26];
+
+ for vote in &votes {
+ for (i, ch) in vote.chars().enumerate() {
+ cnt[(ch as u8 - b'A') as usize][i] += 1;
+ }
+ }
+
+ let mut s: Vec = votes[0].chars().collect();
+
+ s.sort_by(|&a, &b| {
+ let i = (a as u8 - b'A') as usize;
+ let j = (b as u8 - b'A') as usize;
+
+ for k in 0..m {
+ if cnt[i][k] != cnt[j][k] {
+ return cnt[j][k].cmp(&cnt[i][k]);
+ }
+ }
+ a.cmp(&b)
+ });
+
+ s.into_iter().collect()
+ }
}
```
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.cpp b/solution/1300-1399/1366.Rank Teams by Votes/Solution.cpp
index be713a1ca234e..17f110eb84ed5 100644
--- a/solution/1300-1399/1366.Rank Teams by Votes/Solution.cpp
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.cpp
@@ -1,24 +1,24 @@
class Solution {
public:
string rankTeams(vector& votes) {
- int n = votes[0].size();
- int cnt[26][n];
- memset(cnt, 0, sizeof cnt);
- for (auto& vote : votes) {
- for (int i = 0; i < n; ++i) {
- cnt[vote[i] - 'A'][i]++;
+ int m = votes[0].size();
+ array, 26> cnt{};
+
+ for (const auto& vote : votes) {
+ for (int i = 0; i < m; ++i) {
+ ++cnt[vote[i] - 'A'][i];
}
}
- string ans = votes[0];
- sort(ans.begin(), ans.end(), [&](auto& a, auto& b) {
+ string s = votes[0];
+ ranges::sort(s, [&](char a, char b) {
int i = a - 'A', j = b - 'A';
- for (int k = 0; k < n; ++k) {
+ for (int k = 0; k < m; ++k) {
if (cnt[i][k] != cnt[j][k]) {
return cnt[i][k] > cnt[j][k];
}
}
return a < b;
});
- return ans;
+ return string(s.begin(), s.end());
}
-};
\ No newline at end of file
+};
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.go b/solution/1300-1399/1366.Rank Teams by Votes/Solution.go
index 34334b16c7a81..971bd7dc3dc64 100644
--- a/solution/1300-1399/1366.Rank Teams by Votes/Solution.go
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.go
@@ -1,20 +1,20 @@
func rankTeams(votes []string) string {
- cnt := [26][26]int{}
+ m := len(votes[0])
+ cnt := [26][27]int{}
for _, vote := range votes {
- for i, c := range vote {
- cnt[c-'A'][i]++
+ for i, ch := range vote {
+ cnt[ch-'A'][i]++
}
}
- ans := []byte(votes[0])
- sort.Slice(ans, func(i, j int) bool {
- cnt1, cnt2 := cnt[ans[i]-'A'], cnt[ans[j]-'A']
- for k, a := range cnt1 {
- b := cnt2[k]
- if a != b {
- return a > b
+ s := []rune(votes[0])
+ sort.Slice(s, func(i, j int) bool {
+ a, b := s[i]-'A', s[j]-'A'
+ for k := 0; k < m; k++ {
+ if cnt[a][k] != cnt[b][k] {
+ return cnt[a][k] > cnt[b][k]
}
}
- return ans[i] < ans[j]
+ return s[i] < s[j]
})
- return string(ans)
-}
\ No newline at end of file
+ return string(s)
+}
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.java b/solution/1300-1399/1366.Rank Teams by Votes/Solution.java
index 7293c4cd5ed1e..f3e6a69a34f76 100644
--- a/solution/1300-1399/1366.Rank Teams by Votes/Solution.java
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.java
@@ -1,30 +1,29 @@
class Solution {
public String rankTeams(String[] votes) {
- int n = votes[0].length();
- int[][] cnt = new int[26][n];
+ int m = votes[0].length();
+ int[][] cnt = new int[26][m + 1];
for (var vote : votes) {
- for (int i = 0; i < n; ++i) {
- cnt[vote.charAt(i) - 'A'][i]++;
+ for (int i = 0; i < m; ++i) {
+ ++cnt[vote.charAt(i) - 'A'][i];
}
}
- Character[] cs = new Character[n];
- for (int i = 0; i < n; ++i) {
- cs[i] = votes[0].charAt(i);
+ Character[] s = new Character[m];
+ for (int i = 0; i < m; ++i) {
+ s[i] = votes[0].charAt(i);
}
- Arrays.sort(cs, (a, b) -> {
+ Arrays.sort(s, (a, b) -> {
int i = a - 'A', j = b - 'A';
- for (int k = 0; k < n; ++k) {
- int d = cnt[i][k] - cnt[j][k];
- if (d != 0) {
- return d > 0 ? -1 : 1;
+ for (int k = 0; k < m; ++k) {
+ if (cnt[i][k] != cnt[j][k]) {
+ return cnt[j][k] - cnt[i][k];
}
}
return a - b;
});
StringBuilder ans = new StringBuilder();
- for (char c : cs) {
+ for (var c : s) {
ans.append(c);
}
return ans.toString();
}
-}
\ No newline at end of file
+}
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.py b/solution/1300-1399/1366.Rank Teams by Votes/Solution.py
index 88b5c1e147c1e..0c37849308885 100644
--- a/solution/1300-1399/1366.Rank Teams by Votes/Solution.py
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.py
@@ -1,8 +1,8 @@
class Solution:
def rankTeams(self, votes: List[str]) -> str:
- n = len(votes[0])
- cnt = defaultdict(lambda: [0] * n)
+ m = len(votes[0])
+ cnt = defaultdict(lambda: [0] * m)
for vote in votes:
for i, c in enumerate(vote):
cnt[c][i] += 1
- return "".join(sorted(votes[0], key=lambda x: (cnt[x], -ord(x)), reverse=True))
+ return "".join(sorted(cnt, key=lambda c: (cnt[c], -ord(c)), reverse=True))
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.rs b/solution/1300-1399/1366.Rank Teams by Votes/Solution.rs
new file mode 100644
index 0000000000000..8a5fcd7d0b6e6
--- /dev/null
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.rs
@@ -0,0 +1,28 @@
+impl Solution {
+ pub fn rank_teams(votes: Vec) -> String {
+ let m = votes[0].len();
+ let mut cnt = vec![vec![0; m + 1]; 26];
+
+ for vote in &votes {
+ for (i, ch) in vote.chars().enumerate() {
+ cnt[(ch as u8 - b'A') as usize][i] += 1;
+ }
+ }
+
+ let mut s: Vec = votes[0].chars().collect();
+
+ s.sort_by(|&a, &b| {
+ let i = (a as u8 - b'A') as usize;
+ let j = (b as u8 - b'A') as usize;
+
+ for k in 0..m {
+ if cnt[i][k] != cnt[j][k] {
+ return cnt[j][k].cmp(&cnt[i][k]);
+ }
+ }
+ a.cmp(&b)
+ });
+
+ s.into_iter().collect()
+ }
+}
diff --git a/solution/1300-1399/1366.Rank Teams by Votes/Solution.ts b/solution/1300-1399/1366.Rank Teams by Votes/Solution.ts
new file mode 100644
index 0000000000000..e1ac6c0ad05d4
--- /dev/null
+++ b/solution/1300-1399/1366.Rank Teams by Votes/Solution.ts
@@ -0,0 +1,21 @@
+function rankTeams(votes: string[]): string {
+ const m = votes[0].length;
+ const cnt: number[][] = Array.from({ length: 26 }, () => Array(m + 1).fill(0));
+ for (const vote of votes) {
+ for (let i = 0; i < m; i++) {
+ cnt[vote.charCodeAt(i) - 65][i]++;
+ }
+ }
+ const s: string[] = votes[0].split('');
+ s.sort((a, b) => {
+ const i = a.charCodeAt(0) - 65;
+ const j = b.charCodeAt(0) - 65;
+ for (let k = 0; k < m; k++) {
+ if (cnt[i][k] !== cnt[j][k]) {
+ return cnt[j][k] - cnt[i][k];
+ }
+ }
+ return a.localeCompare(b);
+ });
+ return s.join('');
+}