keep learning, keep coding!
Problem - Plus One
You are given a large integer represented as an integer array digits, where each digits[i] is the i
th digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0’s.
Increment the large integer by one and return the resulting array of digits.
翻譯蒟蒻
給定一個整數陣列,其中每個元素表示整數的一位數字,並對最後一位數字加一,回傳新的陣列。
要考慮到進位的可能性。
Example 1:
1
2
3
4
5Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Incrementing by one gives 123 + 1 = 124.
Thus, the result should be [1,2,4].Example 2:
1
2
3
4
5Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
Incrementing by one gives 4321 + 1 = 4322.
Thus, the result should be [4,3,2,2].Example 3:
1
2
3
4
5Input: digits = [9]
Output: [1,0]
Explanation: The array represents the integer 9.
Incrementing by one gives 9 + 1 = 10.
Thus, the result should be [1,0].
Solution - JavaScript
1 | /** |
Solution - Ruby
1 | def plus_one(digits) |
Solution - PHP
1 | function plusOne($digits) { |
PHP 方法筆記
array_unshift
用於將一個或多個元素插入到陣列的開始處。函數的基本語法如下:
1
2
3array_unshift(array &$array, mixed $value1 [, mixed $value2 [, mixed $...]]): int
// 這會修改傳入的陣列 $array,並將指定的值插入到陣列的開始處。然後,回傳新陣列的元素數量,也就是插入後陣列的長度。1
2
3
4
5
6
7
8
9
10
11
12$fruits = array("banana", "apple", "orange");
array_unshift($fruits, "grape", "cherry");
print_r($fruits);
// Array
// (
// [0] => grape
// [1] => cherry
// [2] => banana
// [3] => apple
// [4] => orange
// )