alternating-digit-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

<ul>
	<li>The most significant digit is assigned a positive sign.</li>
	<li>Each other digit has an opposite sign to its adjacent digits.</li>
</ul>

Return the sum of all digits with their corresponding sign.

&nbsp;
Example 1:

<pre>
Input: n = 521
Output: 4
Explanation: (+5) + (-2) + (+1) = 4.
</pre>

Example 2:

<pre>
Input: n = 111
Output: 1
Explanation: (+1) + (-1) + (+1) = 1.
</pre>

Example 3:

<pre>
Input: n = 886996
Output: 0
Explanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

&nbsp;
<style type="text/css">.spoilerbutton {display:block; border:dashed; padding: 0px 0px; margin:10px 0px; font-size:150%; font-weight: bold; color:#000000; background-color:cyan; outline:0; 
}
.spoiler {overflow:hidden;}
.spoiler > div {-webkit-transition: all 0s ease;-moz-transition: margin 0s ease;-o-transition: all 0s ease;transition: margin 0s ease;}
.spoilerbutton[value="Show Message"] + .spoiler > div {margin-top:-500%;}
.spoilerbutton[value="Hide Message"] + .spoiler {padding:5px;}
</style>

alternateDigitSum

Alternating Digit Sum

Add Digits

add-digits

各位相加

Minimum Sum of Four Digit Number After Splitting Digits

minimum-sum-of-four-digit-number-after-splitting-digits

拆分数位后四位数字的最小和

Separate the Digits in an Array

separate-the-digits-in-an-array

分割数组中数字的数位

Math

给你一个正整数 <code>n</code> 。<code>n</code> 中的每一位数字都会按下述规则分配一个符号：

<ul>
	<li>最高有效位 上的数字分配到 正 号。</li>
	<li>剩余每位上数字的符号都与其相邻数字相反。</li>
</ul>

返回所有数字及其对应符号的和。

&nbsp;

示例 1：

<pre>
输入：n = 521
输出：4
解释：(+5) + (-2) + (+1) = 4</pre>

示例 2：

<pre>
输入：n = 111
输出：1
解释：(+1) + (-1) + (+1) = 1
</pre>

示例 3：

<pre>
输入：n = 886996
输出：0
解释：(+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

&nbsp;