File tree Expand file tree Collapse file tree 10 files changed +220
-28
lines changed
0500-0599/0574.Winning Candidate
1200-1299/1287.Element Appearing More Than 25% In Sorted Array Expand file tree Collapse file tree 10 files changed +220
-28
lines changed Original file line number Diff line number Diff line change @@ -61,7 +61,25 @@ CandidateId 是 Candidate 表中的 id.
61
61
### **SQL**
62
62
63
63
```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;
65
83
```
66
84
67
85
<!-- tabs:end -->
Original file line number Diff line number Diff line change @@ -60,7 +60,25 @@ CandidateId is the id appeared in Candidate table.
60
60
### **SQL**
61
61
62
62
```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;
64
82
```
65
83
66
84
<!-- tabs:end -->
Original file line number Diff line number Diff line change
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;
Original file line number Diff line number Diff line change 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)
2
2
3
3
[English Version](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md)
4
4
28
28
<li><code>0 <= arr[i] <= 10^5</code></li>
29
29
</ul>
30
30
31
-
32
31
## 解法
33
32
34
33
<!-- 这里可写通用的实现逻辑 -->
40
39
<!-- 这里可写当前语言的特殊实现逻辑 -->
41
40
42
41
```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
44
49
```
45
50
46
51
### **Java**
47
52
48
53
<!-- 这里可写当前语言的特殊实现逻辑 -->
49
54
50
55
```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
+ ```
51
96
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
+ };
52
113
```
53
114
54
115
### **...**
Original file line number Diff line number Diff line change 29
29
<li><code>0 <= arr[i] <= 10<sup>5</sup></code></li>
30
30
</ul>
31
31
32
-
33
32
## Solutions
34
33
35
34
<!-- tabs:start -->
36
35
37
36
### **Python3**
38
37
39
38
```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
41
46
```
42
47
43
48
### **Java**
44
49
45
50
```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
+ ```
46
91
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
+ };
47
108
```
48
109
49
110
### **...**
Original file line number Diff line number Diff line change
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
+ };
Original file line number Diff line number Diff line change
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
+ }
Original file line number Diff line number Diff line change 1
1
class Solution {
2
2
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)]) {
6
6
return arr[i];
7
7
}
8
8
}
Original file line number Diff line number Diff line change 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
+ }
14
11
}
15
- return item ;
16
- };
12
+ return 0 ;
13
+ };
Original file line number Diff line number Diff line change 1
1
class Solution:
2
2
def findSpecialInteger(self, arr: List[int]) -> int:
3
- total = len(arr)
3
+ n = len(arr)
4
4
for i, val in enumerate(arr):
5
- if val == arr[i + (total >> 2)]:
5
+ if val == arr[i + (n >> 2)]:
6
6
return val
7
- return 0
7
+ return 0
You can’t perform that action at this time.
0 commit comments