Method search

Java/Leetcode/Leetcode34.java:14–35

(int[] arr, int target,boolean isStart)

    }

    static int search(int[] arr, int target,boolean isStart){
        int start=0,end=arr.length-1;int ans=-1;
        while(end>=start){
            int mid=start+(end-start)/2;
            if(target>arr[mid]){
                start=mid+1;
            }
            else if(target<arr[mid]){
                end=mid-1;
            }
            else if(target==arr[mid]){
                ans=mid;
                if(isStart){
                    end=mid-1;
                }
                else{
                    start=mid+1;
                }
            }
        }
        return ans;
    }
}