MCPcopy Create free account
hub / github.com/Blankj/awesome-java-leetcode / Solution

Class Solution

src/com/blankj/easy/_0066/Solution.java:13–37  ·  view source on GitHub ↗

author: Blankj blog : http://blankj.com time : 2017/05/06 desc :

Source from the content-addressed store, hash-verified

11 * </pre>
12 */
13public class Solution {
14 public int[] plusOne(int[] digits) {
15 int p = digits.length - 1;
16 if (digits[p] < 9) {
17 digits[p] = ++digits[p];
18 } else {
19 do {
20 digits[p--] = 0;
21 } while (p >= 0 && digits[p] == 9);
22 if (digits[0] != 0) {
23 ++digits[p];
24 } else {
25 digits = new int[digits.length + 1];
26 digits[0] = 1;
27 }
28 }
29 return digits;
30 }
31
32 public static void main(String[] args) {
33 Solution solution = new Solution();
34 int[] digits = solution.plusOne(new int[]{9, 9, 9});
35 System.out.println(Arrays.toString(digits));
36 }
37}

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected