2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
id: 5900f37d1000cf542c50fe8f
|
2020-12-16 07:37:30 +00:00
|
|
|
|
title: 问题16:电源数字总和
|
2018-10-10 22:03:03 +00:00
|
|
|
|
challengeType: 5
|
|
|
|
|
videoUrl: ''
|
2021-01-13 02:31:00 +00:00
|
|
|
|
dashedName: problem-16-power-digit-sum
|
2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --description--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
2 <sup>15<!-- sup-->= 32768,其位数之和为3 + 2 + 7 + 6 + 8 = 26。 2 <sup><code>指数<!-- code--><!-- sup-->的数字总和是多少?</code></sup></sup>
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --hints--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`powerDigitSum(15)`应该返回26。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(powerDigitSum(15), 26);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`powerDigitSum(128)`应该返回166。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(powerDigitSum(128), 166);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`powerDigitSum(1000)`应返回1366。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(powerDigitSum(1000), 1366);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
2020-08-13 15:24:35 +00:00
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function powerDigitSum(exponent) {
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
powerDigitSum(15);
|
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --solutions--
|
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
```js
|
|
|
|
|
function powerDigitSum(exponent) {
|
|
|
|
|
const bigNum = [1];
|
|
|
|
|
let sum = 0;
|
|
|
|
|
|
|
|
|
|
for (let i = 1; i <= exponent; i++) {
|
|
|
|
|
let count = bigNum.length + 1;
|
|
|
|
|
let overflow = 0;
|
|
|
|
|
for (let j = 0; j < count; j++) {
|
|
|
|
|
let digit = bigNum[j] || 0;
|
|
|
|
|
digit = 2 * digit + overflow;
|
|
|
|
|
|
|
|
|
|
if (digit > 9) {
|
|
|
|
|
digit -= 10;
|
|
|
|
|
overflow = 1;
|
|
|
|
|
} else {
|
|
|
|
|
overflow = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bigNum[j] = digit;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bigNum.forEach(function(num) {
|
|
|
|
|
return sum += num;
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
return sum;
|
|
|
|
|
}
|
|
|
|
|
```
|