题解 | #两个链表生成相加链表#

class Solution {
public:

    bool Findnum(vector<int> array, int target)
    {
        int left=0;
        int right=array.size();
        int index = right;
        while(1)
        {
            index = (left+right)/2;
            if(index == left && array[index]!=target) return false; 
            if(array[index]==target) return true;
            else if(array[index]<target) left=index;
            else right=index;
        }
        return false;
    }

    bool Find(int target, vector<vector<int> > array) {
        int col = array[0].size();
        int row = array.size();
        if(col==0) return false;
        for(int i=0;i<row;i++)
        {
            if(array[i][0]==target || array[i][col-1]==target) return true;
            else if(array[i][0]<target && array[i][col-1]>target)
            {
                if(Findnum(array[i],target)==true) return true;
            }
        }
        return false;
    }
};