Package g2501_2600.s2544_alternating_digit_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2544 - Alternating Digit Sum.

    Easy

    You are given a positive integer n. Each digit of n has a sign according to the following rules:

    • The most significant digit is assigned a positive sign.

    • Each other digit has an opposite sign to its adjacent digits.

    Return the sum of all digits with their corresponding sign.

    Example 1:

    Input: n = 521

    Output: 4

    Explanation: (+5) + (-2) + (+1) = 4.

    Example 2:

    Input: n = 111

    Output: 1

    Explanation: (+1) + (-1) + (+1) = 1.

    Example 3:

    Input: n = 886996

    Output: 0

    Explanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.

    Constraints:

    • <code>1 <= n <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer alternateDigitSum(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait