很标准的暴力解法，我再去看看别人咋解的，哈哈哈~

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        for(auto irow = begin(array); irow != end(array); irow++ ){
            for(auto icol = begin(*irow); icol != end(*irow); icol++){
                if(*icol == target){
                    return true;
                }
            }
        }
        return false;
    }
};