feat: add 066

Author: Blankj

note/066/README.md

@@ -13,10 +13,28 @@ The digits are stored such that the most significant digit is at the head of the
 
 ## 思路
 
-题意是
+题意是给你一个数字数组，高位在前，并且首位不为0除非这个数组就是`[0]`，让你给该数组低位加一求其结果，那么我们就模拟小学数学那样进位去算即可，如果一直进位到首位，这种情况也就是都是由9组成的数组，此时我们只要new出一个多一个长度的数组即可，并把第0个元素赋1即可。
 
 ``` java
-
+public class Solution {
+ public int[] plusOne(int[] digits) {
+ int p = digits.length - 1;
+ if (digits[p] < 9) {
+ digits[p] = ++digits[p];
+ } else {
+ do {
+ digits[p--] = 0;
+ } while (p >= 0 && digits[p] == 9);
+ if (digits[0] != 0) {
+ ++digits[p];
+ } else {
+ digits = new int[digits.length + 1];
+ digits[0] = 1;
+ }
+ }
+ return digits;
+ }
+}
 ```
 
 

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_066/Solution.java

@@ -13,16 +13,28 @@
 
 public class Solution {
  public int[] plusOne(int[] digits) {
-
+ int p = digits.length - 1;
+ if (digits[p] < 9) {
+ digits[p] = ++digits[p];
+ } else {
+ do {
+ digits[p--] = 0;
+ } while (p >= 0 && digits[p] == 9);
+ if (digits[0] != 0) {
+ ++digits[p];
+ } else {
+ digits = new int[digits.length + 1];
+ digits[0] = 1;
+ }
+ }
  return digits;
  }
 
  public static void main(String[] args) {
  Solution solution = new Solution();
- File file = new File("/dev/d/");
- System.out.println(file.getAbsolutePath());
- System.out.println("hello".substring(0, 2));
- int[] digits = new int[]{9, 9, 9};
- System.out.println(solution.plusOne(digits));
+ int[] digits = solution.plusOne(new int[]{9, 9, 9});
+ for (int i = 0; i < digits.length; i++) {
+ System.out.print(digits[i]);
+ }
  }
 }