Commit 989025d

committed

solves #2544: Alternating Digit Sum in java

1 parent 4e0c2f8 commit 989025dCopy full SHA for 989025d

File tree

+15

-1

lines changed

+15

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -796,7 +796,7 @@`
`796`	`796`	`\| 2529 \| [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) \| [![Java](assets/java.png)](src/MaximumCountOfPositiveIntegerAndNegativeInteger.java) \| \|`
`797`	`797`	`\| 2535 \| [Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array) \| [![Java](assets/java.png)](src/DifferenceBetweenElementSumAndDigitSumOfAnArray.java) \| \|`
`798`	`798`	`\| 2540 \| [Minimum Common Value](https://leetcode.com/problems/minimum-common-value) \| [![Java](assets/java.png)](src/MinimumCommonValue.java) \| \|`
`799`		`-\| 2544 \| [Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum) \| \| \|`
	`799`	`+\| 2544 \| [Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum) \| [![Java](assets/java.png)](src/AlternatingDigitSum.java) \| \|`
`800`	`800`	`\| 2549 \| [Count Distinct Numbers on Board](https://leetcode.com/problems/count-distinct-numbers-on-board) \| \| \|`
`801`	`801`	`\| 2553 \| [Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array) \| \| \|`
`802`	`802`	`\| 2558 \| [Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile) \| \| \|`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+// https://leetcode.com/problems/alternating-digit-sum`
	`2`	`+// T: O(log(n))`
	`3`	`+// S: O(1)`
	`4`	`+`
	`5`	`+public class AlternatingDigitSum {`
	`6`	`+ public int alternateDigitSum(int n) {`
	`7`	`+ final String number = n + "";`
	`8`	`+ int sum = 0;`
	`9`	`+ for (int index = 0, parity = 1 ; index < number.length() ; index++, parity *= -1) {`
	`10`	`+ sum += parity * (number.charAt(index) - '0');`
	`11`	`+ }`
	`12`	`+ return sum;`
	`13`	`+ }`
	`14`	`+}`

Comments

(0)