http://oj.leetcode.com/problems/search-insert-position/

SearchInsertPosition.java

public class Solution {
    public int searchInsert(int[] A, int target) {
        int i = 0;
        if (target < A[i]) return 0;
        if (target > A[A.length - 1]) return A.length;
        while ((target >= A[i]) || (i + 1 <= A.length)){
            if (target == A[i]){
                return i;
            }
            if ((target > A[i]) && (target < A[i + 1])){
                return i + 1;
            }
            i++;
        }
        return i;
    }
}