mark occurances of elements in array cpp
int sumOfDistinct(int a[], int n){ int sum = 0; for (int i = 0; i < n; i++) { // If element appears first time if (a[abs(a[i]) - 1] >= 0) { sum += abs(a[i]); a[abs(a[i]) - 1] *= -1; } } return sum;
mark occurances of elements in array cpp
int sumOfDistinct(int a[], int n){ int sum = 0; for (int i = 0; i < n; i++) { // If element appears first time if (a[abs(a[i]) - 1] >= 0) { sum += abs(a[i]); a[abs(a[i]) - 1] *= -1; } } return sum;
frequency count in java using hashmap
static void countFreq(int arr[], int n) { Map<Integer, Integer> mp = new HashMap<>(); // Traverse through array elements and // count frequencies for (int i = 0; i < n; i++) { if (mp.containsKey(arr[i])) { mp.put(arr[i], mp.get(arr[i]) + 1); } else { mp.put(arr[i], 1); } } // Traverse through map and print frequencies for (Map.Entry<Integer, Integer> entry : mp.entrySet()) { System.out.println(entry.getKey() + " " + entry.getValue()); } }
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
