leetcode Search Insert Position(easy) /java

import java.io.*;
import java.util.*;

public class Solution {
        public static int searchInsert(int[] nums, int target) {
        int r=0;
        int len=nums.length;
        if(len==0)
            return 0;
        int i,j;
        i=0;
        while(i<len)
        {
            if(nums[i]<target)
            {
                i++;
            }
            else
            {
                r=i;
                break;
            }
        }
        if(i==len)
            r=len;
        return r;
    }
    public static void main(String[] args)
    {
        int[] a={};
        int[] b={1,2,3,5,7};
        System.out.println(searchInsert(a,0));
        System.out.println(searchInsert(b,8));
    }
}