Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
27 lines (23 loc) · 795 Bytes

File metadata and controls

27 lines (23 loc) · 795 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
package ch22;
public class P89_2 {
public int majorityElement(int left, int right, int[] nums) {
// 최소 분할 단위 리턴
if (left == right)
return nums[left];
// 중앙 위치 인덱스 계산
int mid = left + (right - left) / 2;
int a = majorityElement(left, mid, nums);
int b = majorityElement(mid + 1, right, nums);
int countA = 0;
// 해당 구간의 a 개수 계산
for (int i = left; i <= right; i++) {
if (nums[i] == a)
countA++;
}
// a가 과반수를 넘으면 a 리턴
return countA > (right - left + 1) / 2 ? a : b;
}
public int majorityElement(int[] nums) {
return majorityElement(0, nums.length - 1, nums);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.