g2501_2600.s2578_split_with_minimum_sum.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g2501_2600.s2578_split_with_minimum_sum;
// #Easy #Math #Sorting #Greedy #2023_08_22_Time_0_ms_(100.00%)_Space_39.3_MB_(76.63%)
public class Solution {
public int splitNum(int number) {
int num1 = 0;
int num2 = 0;
boolean addToOne = true;
for (int i = 0; i <= 9; i++) {
int tmpNumber = number;
while (tmpNumber > 0) {
int digit = tmpNumber % 10;
if (digit == i) {
if (addToOne) {
num1 *= 10;
num1 += digit;
addToOne = false;
} else {
num2 *= 10;
num2 += digit;
addToOne = true;
}
}
tmpNumber /= 10;
}
}
return num1 + num2;
}
}