@@ -0,0 +1,637 @@
+public class Solution %7B%0A    /*%0A     * @param nums: An integer array sorted in ascending order%0A     * @param target: An integer%0A     * @return: An integer%0A     */%0A    public int findPosition(int%5B%5D nums, int target) %7B%0A        // write your code here%0A        %0A        int low = 0;%0A        int high = nums.length - 1;%0A        %0A        while(low + 1 %3C high) %7B%0A            int mid = (high - low) / 2 + low;%0A            if(nums%5Bmid%5D == target) %7B%0A                return mid;%0A            %7D else if(nums%5Bmid%5D %3E target) %7B%0A                high = mid;%0A            %7D else %7B%0A                low = mid;%0A            %7D%0A        %7D%0A        return -1;%0A    %7D%0A%7D

add 457