g2001_2100.s2029_stone_game_ix.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g2001_2100.s2029_stone_game_ix;
// #Medium #Array #Math #Greedy #Counting #Game_Theory
// #2022_06_21_Time_14_ms_(53.97%)_Space_126.8_MB_(25.40%)
public class Solution {
public boolean stoneGameIX(int[] stones) {
int zero = 0;
int one = 0;
int two = 0;
for (int i : stones) {
if (i % 3 == 0) {
zero++;
} else if (i % 3 == 1) {
one++;
} else if (i % 3 == 2) {
two++;
}
}
if (one == 0 && two == 0) {
return false;
}
int max = Math.max(one, two);
int min = Math.min(one, two);
if (zero % 2 == 0) {
return min != 0;
}
if (zero % 2 == 1) {
return max - 2 > min;
}
return false;
}
}