Skip to content

Commit e406512

Browse files
committed
practicet to solve pluse one:
1 parent 35994ff commit e406512

1 file changed

Lines changed: 46 additions & 1 deletion

File tree

javascript/index.js

Lines changed: 46 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1198,4 +1198,49 @@ let s = "IceCreAm";
11981198
* The vowels in s are ['I', 'e', 'e', 'A']. On reversing the vowels, s becomes "AceCreIm".
11991199
*
12001200
*/
1201-
console.log(reverseVowels(s));
1201+
// console.log(reverseVowels(s));
1202+
1203+
/**
1204+
* 66. Plus One
1205+
*
1206+
* 參數為數值陣列,將該參數+1並以數字陣列回傳
1207+
* 只需要知道最後一個數字是什麼並將它+1
1208+
* @param {number[]} digits
1209+
* @return {number[]}
1210+
*/
1211+
var plusOne = function(digits) {
1212+
// 只需要知道最後一個數字是什麼並將它+1
1213+
// 若 +1 位數 >= 2,則拆開
1214+
1215+
// let toInt = parseInt(digits.join(""))+1;
1216+
// let splitToArray = toInt.toString().split("");
1217+
// let res = [];
1218+
// for(let i = 0;i < splitToArray.length;++i) {
1219+
// res.push(parseInt(splitToArray[i]));
1220+
// }
1221+
// return res;
1222+
1223+
// let lastElePlusOne = digits[digits.length -1]+1;
1224+
// digits.pop()
1225+
// digits.push(lastElePlusOne)
1226+
// return digits;
1227+
1228+
let lastElePlusOne = 0;
1229+
let last = digits[digits.length -1];
1230+
if(last <= 9){
1231+
lastElePlusOne = (last + 1).toString().split("");
1232+
}else{
1233+
lastElePlusOne = (last + 1);
1234+
}
1235+
digits.pop();
1236+
digits.push(lastElePlusOne)
1237+
return digits;
1238+
};
1239+
// let digits = [1,2,3];
1240+
//[1,2,4]
1241+
// Explanation: The array represents the integer 123.
1242+
// Incrementing by one gives 123 + 1 = 124.
1243+
// Thus, the result should be [1,2,4].
1244+
let digits = [9];
1245+
// [1,0]
1246+
console.log(plusOne(digits));

0 commit comments

Comments
 (0)