Skip to content

Commit 5fb4fbf

Browse files
yanglbmeyanglbme
committed
feat: add solutions to lc problems: No.0574,1287
1 parent f08a5df commit 5fb4fbf

File tree

10 files changed

+220
-28
lines changed

10 files changed

+220
-28
lines changed

‎solution/0500-0599/0574.Winning Candidate/README.md‎

Lines changed: 19 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -61,7 +61,25 @@ CandidateId 是 Candidate 表中的 id.
6161
### **SQL**
6262

6363
```sql
64-
64+
# Write your MySQL query statement below
65+
SELECT
66+
Name
67+
FROM
68+
(
69+
SELECT
70+
CandidateId AS id
71+
FROM
72+
Vote
73+
GROUP BY
74+
CandidateId
75+
ORDER BY
76+
COUNT(id) DESC
77+
LIMIT 1
78+
) AS t
79+
INNER JOIN
80+
Candidate c
81+
ON
82+
t.id = c.id;
6583
```
6684

6785
<!-- tabs:end -->

‎solution/0500-0599/0574.Winning Candidate/README_EN.md‎

Lines changed: 19 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,25 @@ CandidateId is the id appeared in Candidate table.
6060
### **SQL**
6161

6262
```sql
63-
63+
# Write your MySQL query statement below
64+
SELECT
65+
Name
66+
FROM
67+
(
68+
SELECT
69+
CandidateId AS id
70+
FROM
71+
Vote
72+
GROUP BY
73+
CandidateId
74+
ORDER BY
75+
COUNT(id) DESC
76+
LIMIT 1
77+
) AS t
78+
INNER JOIN
79+
Candidate c
80+
ON
81+
t.id = c.id;
6482
```
6583

6684
<!-- tabs:end -->

‎solution/0500-0599/0574.Winning Candidate/Solution.sql‎

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
# Write your MySQL query statement below
2+
SELECT
3+
Name
4+
FROM
5+
(
6+
SELECT
7+
CandidateId AS id
8+
FROM
9+
Vote
10+
GROUP BY
11+
CandidateId
12+
ORDER BY
13+
COUNT(id) DESC
14+
LIMIT 1
15+
) AS t
16+
INNER JOIN
17+
Candidate c
18+
ON
19+
t.id = c.id;

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/README.md‎

Lines changed: 64 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [1287. 有序数组中出现次数超过25%的元素](https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array)
1+
# [1287. 有序数组中出现次数超过 25%的元素](https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array)
22

33
[English Version](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md)
44

@@ -28,7 +28,6 @@
2828
<li><code>0 &lt;= arr[i] &lt;= 10^5</code></li>
2929
</ul>
3030

31-
3231
## 解法
3332

3433
<!-- 这里可写通用的实现逻辑 -->
@@ -40,15 +39,77 @@
4039
<!-- 这里可写当前语言的特殊实现逻辑 -->
4140

4241
```python
43-
42+
class Solution:
43+
def findSpecialInteger(self, arr: List[int]) -> int:
44+
n = len(arr)
45+
for i, val in enumerate(arr):
46+
if val == arr[i + (n >> 2)]:
47+
return val
48+
return 0
4449
```
4550

4651
### **Java**
4752

4853
<!-- 这里可写当前语言的特殊实现逻辑 -->
4954

5055
```java
56+
class Solution {
57+
public int findSpecialInteger(int[] arr) {
58+
int n = arr.length;
59+
for (int i = 0; i < n; ++i) {
60+
if (arr[i] == arr[i + (n >> 2)]) {
61+
return arr[i];
62+
}
63+
}
64+
return 0;
65+
}
66+
}
67+
```
68+
69+
### **C++**
70+
71+
```cpp
72+
class Solution {
73+
public:
74+
int findSpecialInteger(vector<int>& arr) {
75+
int n = arr.size();
76+
for (int i = 0; i < n; ++i)
77+
if (arr[i] == arr[i + (n >> 2)]) return arr[i];
78+
return 0;
79+
}
80+
};
81+
```
82+
83+
### **Go**
84+
85+
```go
86+
func findSpecialInteger(arr []int) int {
87+
n := len(arr)
88+
for i, val := range arr {
89+
if val == arr[i+(n>>2)] {
90+
return val
91+
}
92+
}
93+
return 0
94+
}
95+
```
5196

97+
### **JavaScript**
98+
99+
```js
100+
/**
101+
* @param {number[]} arr
102+
* @return {number}
103+
*/
104+
var findSpecialInteger = function(arr) {
105+
const n = arr.length;
106+
for (let i = 0; i < n; ++i) {
107+
if (arr[i] == arr[i + (n >> 2)]) {
108+
return arr[i];
109+
}
110+
}
111+
return 0;
112+
};
52113
```
53114

54115
### **...**

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/README_EN.md‎

Lines changed: 63 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -29,21 +29,82 @@
2929
<li><code>0 &lt;= arr[i] &lt;= 10<sup>5</sup></code></li>
3030
</ul>
3131

32-
3332
## Solutions
3433

3534
<!-- tabs:start -->
3635

3736
### **Python3**
3837

3938
```python
40-
39+
class Solution:
40+
def findSpecialInteger(self, arr: List[int]) -> int:
41+
n = len(arr)
42+
for i, val in enumerate(arr):
43+
if val == arr[i + (n >> 2)]:
44+
return val
45+
return 0
4146
```
4247

4348
### **Java**
4449

4550
```java
51+
class Solution {
52+
public int findSpecialInteger(int[] arr) {
53+
int n = arr.length;
54+
for (int i = 0; i < n; ++i) {
55+
if (arr[i] == arr[i + (n >> 2)]) {
56+
return arr[i];
57+
}
58+
}
59+
return 0;
60+
}
61+
}
62+
```
63+
64+
### **C++**
65+
66+
```cpp
67+
class Solution {
68+
public:
69+
int findSpecialInteger(vector<int>& arr) {
70+
int n = arr.size();
71+
for (int i = 0; i < n; ++i)
72+
if (arr[i] == arr[i + (n >> 2)]) return arr[i];
73+
return 0;
74+
}
75+
};
76+
```
77+
78+
### **Go**
79+
80+
```go
81+
func findSpecialInteger(arr []int) int {
82+
n := len(arr)
83+
for i, val := range arr {
84+
if val == arr[i+(n>>2)] {
85+
return val
86+
}
87+
}
88+
return 0
89+
}
90+
```
4691

92+
### **JavaScript**
93+
94+
```js
95+
/**
96+
* @param {number[]} arr
97+
* @return {number}
98+
*/
99+
var findSpecialInteger = function(arr) {
100+
const n = arr.length;
101+
for (let i = 0; i < n; ++i) {
102+
if (arr[i] == arr[i + (n >> 2)]) {
103+
return arr[i];
104+
}
105+
}
106+
return 0;
107+
};
47108
```
48109

49110
### **...**

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/Solution.cpp‎

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
class Solution {
2+
public:
3+
int findSpecialInteger(vector<int>& arr) {
4+
int n = arr.size();
5+
for (int i = 0; i < n; ++i)
6+
if (arr[i] == arr[i + (n >> 2)]) return arr[i];
7+
return 0;
8+
}
9+
};

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/Solution.go‎

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
func findSpecialInteger(arr []int) int {
2+
n := len(arr)
3+
for i, val := range arr {
4+
if val == arr[i+(n>>2)] {
5+
return val
6+
}
7+
}
8+
return 0
9+
}

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/Solution.java‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
class Solution {
22
public int findSpecialInteger(int[] arr) {
3-
int total = arr.length;
4-
for (int i = 0; i < total; ++i) {
5-
if (arr[i] == arr[i + (total >> 2)]) {
3+
int n = arr.length;
4+
for (int i = 0; i < n; ++i) {
5+
if (arr[i] == arr[i + (n >> 2)]) {
66
return arr[i];
77
}
88
}

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/Solution.js‎

Lines changed: 12 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,13 @@
1-
const findSpecialInteger = function (arr) {
2-
let count = 0;
3-
let item = -1;
4-
for (var i = 0; i < arr.length; i++) {
5-
if (item == arr[i]) {
6-
count++;
7-
} else {
8-
item = arr[i];
9-
count = 1;
10-
}
11-
if (count > arr.length * 0.25) {
12-
return item;
13-
}
1+
/**
2+
* @param {number[]} arr
3+
* @return {number}
4+
*/
5+
var findSpecialInteger = function(arr) {
6+
const n = arr.length;
7+
for (let i = 0; i < n; ++i) {
8+
if (arr[i] == arr[i + (n >> 2)]) {
9+
return arr[i];
10+
}
1411
}
15-
return item;
16-
};
12+
return 0;
13+
};

‎solution/1200-1299/1287.Element Appearing More Than 25% In Sorted Array/Solution.py‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
class Solution:
22
def findSpecialInteger(self, arr: List[int]) -> int:
3-
total = len(arr)
3+
n = len(arr)
44
for i, val in enumerate(arr):
5-
if val == arr[i + (total >> 2)]:
5+
if val == arr[i + (n >> 2)]:
66
return val
7-
return 0
7+
return 0

0 commit comments

Comments
 (0)