leetcode1：线性表

//定义二维数组
int **array = new int*[row_num];
    for(int i=;i<row_num;i++)
    {
        array[i] = new int[col_num];
    }

vector<vector<int>> v2(row_num,vector<int>(col_num,));

//删除排好序数组中重复的数据，返回剩余数组的长度

//int A[]: input array
//len: the array length
//dup: the times that duplicates can be allowed
//return the length of the result array

int removeDuplicate(int A[],int len,int dup)
{
    if(len <= dup)
        return len;

    int index = dup;
    for(int i=dup;i<len;i++)
    {
        if(A[index-dup] != A[i])
        {
            A[index++] = A[i];
        }
    }
    return index;
}

int main()
{
    int A[] = {,,,,,,,,};
    std::cout << removeDuplicate(A,,) << " ";
    std::cout << removeDuplicate(A,,) << " ";
    std::cout << removeDuplicate(A,,) << " ";
    return ;
}

/*******************************************
binary_search to find a target from a Rotated Array
len: the length of A[]
********************************************/
int binary_search(int A[],int len,int target)
{
    if(len <= )
        return -;
    int first = ;
    int last = len;
    int mid;
    while(first != last)
    {
        mid = (first + last)/;

        if(A[mid] == target)
            return mid;

        if(A[first] <= A[mid])
        {
            if(A[first] <= target && target < A[mid])
                last = mid;
            else
                first = mid + ;
        }
        else
        {
            if(A[mid] < target && target <= A[last - ])
                first = mid + ;
            else
                last = mid;
        }
    }
    return -;
}
int main()
{
    int A[] = {,,,,,,,,};
    for(int i=;i<;i++)
    {
        std::cout << binary_search(A,,i) << " ";
    }
    return ;
}