@@ -0,0 +1,605 @@
+package leetcode.oj.SearchInsertionPosition;%0A%0A/**%0A * Created by mark on 2/10/14.%0A */%0A%0Apublic class Solution %7B%0A    public int searchInsert(int%5B%5D A, int target) %7B%0A        int i = 0;%0A        int position = -1;%0A        while (i %3C A.length) %7B%0A            if (A%5Bi%5D == target) %7B%0A                position = i;%0A                break;%0A            %7D else if (A%5Bi%5D %3C target) %7B%0A                i++;%0A                continue;%0A            %7D else %7B%0A                position = i;%0A                break;%0A            %7D%0A        %7D%0A%0A        if (position == -1)%0A            position = A.length;%0A%0A        return position;%0A    %7D%0A%7D

add solution