Question

convert the following code from python to java.

def topkFrequent(nums, k): if not nums: return [ ] if len(nums) == 1: return nums [0] # first find freq freq dict d = {} for num in nums: if num in d: d[num] -= 1 # reverse the sign on the freq for the heap's sake else: d[num] = -1 h = [] from heapq import heappush, heappop for key in di heappush(h, (d[key], key)) res = [] count = 0 while count < k: frq, item = heappop(h) res.append( item) count += 1 return res nums = list(input().split()) k = int(input()) r = topkFrequent (nums, k) for i in range( len(r)): print(str(i+1)+", "+r[i])

Answer 1

// PLEASE LIKE THE SOLUTION
// FEEL FREE TO DISCUSS IN COMMENT SECTION
// Java Program
import java.util.*;

class Frequent{
   // function topKFrequent
   static int[] topKFrequent(int array[],int k){
       // defining array of 100000 length
       // for hashing

       int arr[] = new int[100000];
       int value[] = new int[100000];

       // all values are initialized with 0
       // now update frequency

       for(int i=0;i<arr.length;i++){
           arr[i] = 0;
           value[i] = i;
       }

       // now update frequency
       for(int i=0;i<array.length;i++){
           arr[array[i]]++;
       }

       // now sort
       for(int i=0;i<arr.length;i++){
           for(int j=i+1;j<arr.length;j++){
               if(arr[i] < arr[j]){
                   int temp = arr[i];
                   arr[i] = arr[j];
                   arr[j] = temp;

                   temp = value[i];
                   value[i] = value[j];
                   value[j] = temp;
               }
           }
       }

       int top[] = new int[k];

       // now adding to array top k frequent
       for(int i=0;i<k;i++){
           top[i] = value[i];
       }
       return top;
   }

   // main method
   public static void main(String arg[]){
       // input list
       Scanner scan = new Scanner(System.in);
       String inp = scan.nextLine();

       //String s = scan.next();

       // array split by space
       String values[] = inp.split(" ");

       // now parse to int
       int array[] = new int[values.length];

       for(int i=0;i<array.length;i++){
           array[i] = Integer.parseInt(values[i]);
       }

       // scan k
       int k = scan.nextInt();

       // call top k
       int result[] = topKFrequent(array,k);

       // printing the result
       for(int i=0;i<result.length;i++){
           System.out.println((i+1)+". "+result[i]);
       }
   }
}

// SAMPLE OUTPUT

kashyap@kashyap-Inspiron-3542:-/Pictures/cch$ javac Program.java kashyap@kashyap-Inspiron-3542:~/Pictures/cch$ java Frequent 45 45 45 87 87 5 5 5 5 8 7 8 7 6 4 8 9 4 1. 5 2. 8 3. 45 4. 7 kashyap@kashyap-Inspiron-3542:-/Pictures/cchs |