@@ -0,0 +1,1118 @@
+//66. Plus One%0A/**%0A * Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.%0A * %0A * You may assume the integer do not contain any leading zero, except the number 0 itself.%0A * %0A * The digits are stored such that the most significant digit is at the head of the list.%0A * %0A * Tags: Array, Math%0A * %0A * Similar Problems:  (M) Multiply Strings (E) Add Binary (M) Plus One Linked List%0A * %0A * @author Xinyue Zhang%0A *%0A */%0A%0Apublic class Solution %7B%0A    public int%5B%5D plusOne(int%5B%5D digits) %7B%0A        int n = digits.length;%0A        %0A        for (int i = n - 1; i %3E= 0; i--) %7B%0A            if (digits%5Bi%5D %3C 9) %7B%0A                digits%5Bi%5D++;%0A                return digits;%0A            %7D%0A            else%0A                digits%5Bi%5D = 0;%0A        %7D%0A        %0A        int%5B%5D res = new int%5Bn + 1%5D;%0A        res%5B0%5D = 1;%0A        return res;%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Solution sol = new Solution();%0A        int%5B%5D digits = %7B9,9,9,9%7D;%0A        int%5B%5D res = sol.plusOne(digits);%0A        for (int i = 0; i %3C res.length; i++)%0A            System.out.println(res%5Bi%5D);%0A    %7D%0A%7D%0A

Add solution for 066 plus one