@@ -0,0 +1,1660 @@
+class Solution %7B%0A    /*%0A        Rule 1%0A        - Given array is sorted in non-decreasing order%0A        %0A        Rule 2%0A        - Limit time complexity O(log n).%0A        %0A        So I can use Binary Search Algorithm.%0A    */%0A    public int%5B%5D searchRange(int%5B%5D nums, int target) %7B%0A        // initialize arr%5B0%5D -%3E maximum integer, arr%5B1%5D -%3E minimum integer%0A        int%5B%5D arr = %7B100001, -10%7D;%0A        int s = 0;%0A        int e = nums.length - 1;%0A        %0A        // find minimum index in nums with Binary Search alogorithm%0A        while (s %3C= e) %7B%0A            %0A            int mid = (s + e) / 2;%0A            %0A            if(nums%5Bmid%5D %3E target) %7B%0A                e = mid - 1;%0A            %7D%0A            else if(nums%5Bmid%5D %3C= target) %7B%0A                if(nums%5Bmid%5D == target) %7B%0A                    arr%5B0%5D = Math.min(arr%5B0%5D, mid);%0A                    arr%5B1%5D = Math.max(arr%5B1%5D, mid);%0A                %7D%0A                s = mid + 1;%0A            %7D%0A        %7D%0A        %0A        s = 0;%0A        e = nums.length - 1;%0A        %0A        // find maximum index in nums with Binary Search alogorithm%0A        while(s %3C= e) %7B%0A            int mid = (s + e) / 2;%0A            %0A            if(nums%5Bmid%5D %3E= target) %7B%0A                if(nums%5Bmid%5D == target) %7B%0A                    arr%5B0%5D = Math.min(arr%5B0%5D, mid);%0A                    arr%5B1%5D = Math.max(arr%5B1%5D, mid);%0A                %7D%0A                e = mid - 1;%0A            %7D%0A            else if(nums%5Bmid%5D %3C target) %7B%0A                s = mid + 1;%0A            %7D%0A        %7D%0A        %0A        // if arr data is initial data, set -1.%0A        if(arr%5B0%5D == 100001) arr%5B0%5D = -1;%0A        if(arr%5B1%5D == -10) arr%5B1%5D = -1;%0A        %0A        return arr;%0A    %7D%0A%7D%0A

Add java solution for 34 (#65)