g3001_3100.s3046_split_the_array.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g3001_3100.s3046_split_the_array;
// #Easy #Array #Hash_Table #Counting #2024_02_29_Time_1_ms_(98.82%)_Space_42.8_MB_(63.55%)
public class Solution {
public boolean isPossibleToSplit(int[] nums) {
int[] a = new int[101];
for (int n : nums) {
a[n]++;
if (a[n] > 2) {
return false;
}
}
return true;
}
}