-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram50.java
More file actions
55 lines (39 loc) · 1.11 KB
/
program50.java
File metadata and controls
55 lines (39 loc) · 1.11 KB
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
169. Majority Element
Easy
14.6K
442
Companies
Given an array nums of size n, return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
Example 1:
Input: nums = [3,2,3]
Output: 3
Example 2:
Input: nums = [2,2,1,1,1,2,2]
Output: 2
*/
package LeetCode;
public class program50 {
static int majorityElement(int[] nums) {
int max = 0;
int id = 0;
for(int i=0;i<nums.length;i++){
int cnt=1;
for(int j=i+1;j<nums.length;j++){
if(nums[i]==nums[j]){
cnt++;
}
}
if(cnt > max){
max = cnt;
id = i;
}
}
return nums[id];
}
public static void main(String[] args) {
int[] nums ={3,2,3};
System.out.println(majorityElement(nums));
}
}