g2501_2600.s2544_alternating_digit_sum.readme.md Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

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:**

*   1 <= n <= 10⁹