feat: 066

Author: Blankj

note/058/README.md

@@ -19,7 +19,7 @@ return `5`.
 
 ## 思路
 
-题意是让你从一个只包含大小字母和空格字符的字符串中得到最后一个单词的长度，很简单，我们倒序遍历，先得到最后一个非空格字符的索引，然后再得到它前面的空格字符索引，两者相减即可。当然，我们使用API来完成这件事更加方便，只需一行代码`return s.trim().length()-s.trim().lastIndexOf(" ")-1;`，但我相信作者出这道题的目的肯定不是考你API的使用，所以我们还是用自己的思路来实现。
+题意是让你从一个只包含大小字母和空格字符的字符串中得到最后一个单词的长度，很简单，我们倒序遍历，先得到最后一个非空格字符的索引，然后再得到它前面的空格字符索引，两者相减即可。当然，我们使用API来完成这件事更加方便，只需一行代码`return s.trim().length() - s.trim().lastIndexOf(" ") - 1;`，但我相信作者出这道题的目的肯定不是考你API的使用，所以我们还是用自己的思路来实现。
 
 ``` java
 public class Solution {

note/066/README.md

@@ -0,0 +1,30 @@
+# [Plus One][title]
+
+## Description
+
+Given a non-negative integer represented as a **non-empty** array of digits, plus one to the integer.
+
+You may assume the integer do not contain any leading zero, except the number 0 itself.
+
+The digits are stored such that the most significant digit is at the head of the list.
+
+**Tags:** Array, Math
+
+
+## 思路
+
+题意是
+
+``` java
+
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/plus-one
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

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

@@ -10,36 +10,36 @@
  */
 
 public class Solution {
+    //    public int maxSubArray(int[] nums) {
+//        int len = nums.length, dp = nums[0], max = dp;
+//        for (int i = 1; i < len; ++i) {
+//            dp = nums[i] + (dp > 0 ? dp : 0);
+//            if (dp > max) max = dp;
+//        }
+//        return max;
+//    }
     public int maxSubArray(int[] nums) {
-        int len = nums.length, dp = nums[0], max = dp;
-        for (int i = 1; i < len; ++i) {
-            dp = nums[i] + (dp > 0 ? dp : 0);
-            if (dp > max) max = dp;
+        return helper(nums, 0, nums.length - 1);
+    }
+
+    private int helper(int[] nums, int left, int right) {
+        if (left >= right) return nums[left];
+        int mid = (left + right) >> 1;
+        int leftAns = helper(nums, left, mid);
+        int rightAns = helper(nums, mid + 1, right);
+        int leftMax = nums[mid], rightMax = nums[mid + 1];
+        int temp = 0;
+        for (int i = mid; i >= left; --i) {
+            temp += nums[i];
+            if (temp > leftMax) leftMax = temp;
+        }
+        temp = 0;
+        for (int i = mid + 1; i <= right; ++i) {
+            temp += nums[i];
+            if (temp > rightMax) rightMax = temp;
         }
-        return max;
+        return Math.max(Math.max(leftAns, rightAns), leftMax + rightMax);
     }
-//    public int maxSubArray(int[] nums) {
-//        return helper(nums, 0, nums.length - 1);
-//    }
-//
-//    private int helper(int[] nums, int left, int right) {
-//        if (left >= right) return nums[left];
-//        int mid = (left + right) >> 1;
-//        int leftAns = helper(nums, left, mid);
-//        int rightAns = helper(nums, mid + 1, right);
-//        int leftMax = nums[mid], rightMax = nums[mid + 1];
-//        int temp = 0;
-//        for (int i = mid; i >= left; --i) {
-//            temp += nums[i];
-//            if (temp > leftMax) leftMax = temp;
-//        }
-//        temp = 0;
-//        for (int i = mid + 1; i <= right; ++i) {
-//            temp += nums[i];
-//            if (temp > rightMax) rightMax = temp;
-//        }
-//        return Math.max(Math.max(leftAns, rightAns), leftMax + rightMax);
-//    }
 
     public static void main(String[] args) {
         Solution solution = new Solution();

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

@@ -0,0 +1,28 @@
+package com.blankj.easy._066;
+
+import java.io.File;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/04/21
+ *     desc  :
+ * </pre>
+ */
+
+public class Solution {
+    public int[] plusOne(int[] digits) {
+
+        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));
+    }
+}

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_008/Solution.java renamed to project/LeetCode/leetcode/src/main/java/com/blankj/medium/_008/Solution.java

@@ -1,4 +1,4 @@
-package com.blankj.easy._008;
+package com.blankj.medium._008;
 
 /**
  * <pre>

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_019/Solution.java renamed to project/LeetCode/leetcode/src/main/java/com/blankj/medium/_019/Solution.java

@@ -1,7 +1,4 @@
-package com.blankj.easy._019;
-
-import java.util.Arrays;
-import java.util.HashMap;
+package com.blankj.medium._019;
 
 /**
  * <pre>