Commit ebabeb1

authored

Create Check if Any Element Has Prime Frequency.java

1 parent a802621 commit ebabeb1Copy full SHA for ebabeb1

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+class Solution {`
	`2`	`+ public boolean checkPrimeFrequency(int[] nums) {`
	`3`	`+ Map<Integer, Integer> map = new HashMap<>();`
	`4`	`+ for (int num : nums) {`
	`5`	`+ map.put(num, map.getOrDefault(num, 0) + 1);`
	`6`	`+ }`
	`7`	`+ for (Integer value : map.values()) {`
	`8`	`+ if (isPrime(value)) {`
	`9`	`+ return true;`
	`10`	`+ }`
	`11`	`+ }`
	`12`	`+ return false;`
	`13`	`+ }`
	`14`	`+`
	`15`	`+ private static boolean isPrime(int num) {`
	`16`	`+ for (int i = 2; i <= num / 2; i++) {`
	`17`	`+ if (num % i == 0) {`
	`18`	`+ return false;`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+ return num > 1 && true;`
	`22`	`+ }`
	`23`	`+}`

Comments

(0)