g2501_2600.s2544_alternating_digit_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.s2544_alternating_digit_sum;
// #Easy #Math #2023_05_11_Time_0_ms_(100.00%)_Space_39.4_MB_(79.49%)
public class Solution {
public int alternateDigitSum(int n) {
String s = Integer.toString(n);
char[] arr = s.toCharArray();
int res = 0;
for (int i = 0; i < arr.length; i++) {
res += (int) Math.pow(-1, i) * (arr[i] - '0');
}
return res;
}
}