【leetcode】在排序数组中查找数字

int search(int* nums, int numsSize, int target){
    if (numsSize == 0)
        return 0;
    int count = 0;
    int i,j,index =0;
    for (i=0; i<numsSize; i++)
    {
        if (nums[i] == target)
        {
            index = i;   //先找到下标开始
            break;
        }            
    }
    while(index < numsSize && nums[index] == target)
    {
        count++;
        index++;
    }
    return count;    
}