|
|
JavaScript 解法(含测试,不知道有没有漏掉edge case):
- function plusOne(digits) {
- // step is either 1, -1
- function increment(digits, step) {
- let carry = step;
- for (let i = digits.length - 1; i >= 0; --i) {
- let intVal = parseInt(digits[i]);
- intVal += carry;
- if (intVal >= 10) {
- carry = 1;
- digits[i] = (intVal % 10).toString();
- } else if (intVal <= 0) {
- carry = -1;
- digits[i] = ((10 + intVal) % 10).toString();
- } else {
- carry = 0;
- digits[i] = intVal.toString(); // <---- don't forget to update the digit
- }
- }
- if (carry === 1) {
- digits.splice(0, 0, '1');
- } else if (carry === -1 && digits.length > 1) {
- digits.shift(); // first one must be '0'
- }
- }
- if (digits[0] === '-') {
- digits.shift();
- // digits[0] = digits[0][1]; // set it to positive to make increment easier
- increment(digits, -1);
- if (digits[0] !== '0') {
- digits.splice(0, 0, '-'); // insert negative sign
- }
- } else {
- increment(digits, 1);
- }
- return digits;
- }
- // 测试
- plusOne(['0']) // ['1']
- plusOne(['9']) // ["1", "0"]
- plusOne(['1','9']) // ["2", "0"]
- plusOne(['-','9']) // ["-", "8"]
- plusOne(['-','1']) // ["0"]
复制代码
补充内容 (2017-10-16 20:20):
忘记删除 代码里的comment 了,大家将就看哈。这个应该是可以直接在Chrome 或者Node 里面运行的,亲测可用<( ̄︶ ̄)> |
|