LeetCode & Q35-Search Insert Position-Easy

<span class="kw">public</span> <span class="kw">class</span> Solution {
    <span class="kw">public</span> <span class="dt">int</span> <span class="fu">searchInsert</span>(<span class="dt">int</span>[] nums, <span class="dt">int</span> target) {
        <span class="dt">int</span> i = <span class="dv">0</span>;
        <span class="kw">for</span>(i = <span class="dv">0</span>; i < nums.<span class="fu">length</span>; i++) {
            <span class="kw">if</span>(target <= nums[i])
                <span class="kw">break</span>;
        }
        <span class="kw">if</span>(i < nums.<span class="fu">length</span>)
            <span class="kw">return</span> i;
        <span class="kw">else</span>
            <span class="kw">return</span> i++;
    }
}

<span class="kw">public</span> <span class="dt">int</span> <span class="fu">searchInsert</span>(<span class="dt">int</span>[] A, <span class="dt">int</span> target) {
    <span class="dt">int</span> low = <span class="dv">0</span>, high = A.<span class="fu">length</span><span class="dv">-1</span>;
    <span class="kw">while</span>(low<=high){
        <span class="dt">int</span> mid = (low+high)/<span class="dv">2</span>;
        <span class="kw">if</span>(A[mid] == target) <span class="kw">return</span> mid;
        <span class="kw">else</span> <span class="kw">if</span>(A[mid] > target) high = mid<span class="dv">-1</span>;
        <span class="kw">else</span> low = mid<span class="dv">+1</span>;
    }
    <span class="kw">return</span> low;
}