-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram64.java
More file actions
62 lines (35 loc) · 1.04 KB
/
program64.java
File metadata and controls
62 lines (35 loc) · 1.04 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
56
57
58
59
60
61
62
/*
347. Top K Frequent Elements
Medium
13.5K
496
Companies
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
Example 1:
Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
Example 2:
Input: nums = [1], k = 1
Output: [1]
*/
package LeetCode;
import java.util.HashMap;
import java.util.HashSet;
public class program64 {
static int[] topKFrequent(int[] nums, int k) {
int res[] = new int[k];
HashMap<Integer,Integer>hsm = new HashMap<>();
int cnt=0;
for(int i=0;i<nums.length;i++){
if(!hsm.containsKey(nums[i])){
}
}
System.out.println(hsm);
return res;
}
public static void main(String[] args) {
int[] nums = {1,1,1,2,2,3};
int k =2;
System.out.println(topKFrequent(nums, k));
}
}