// 如果查找的元素比当前位置元素小, 就向左走 // 如果查找的元素比当前位置元素大, 就向下走 for ( int i = 0 , j = col - 1 ; ( i >= 0 && i < row ) && ( j >= 0 && j < col );) if ( target == array [ i ][ j ]) res = true ; break ; else if ( target < array [ i ][ j ]) // 小的元素在当前位置左侧 #ifdef __tmain display ( array ); #endif // __tmain j -- ; #ifdef __tmain display ( array ); #endif // __tmain i ++ ; return res ; void display ( vector < int > vec ) int len = vec . size (); for ( int i = 0 ; i < len ; i ++ ) cout << vec [ i ] << ' ' ; cout << endl ; int __main () int a1 [] = { 1 , 2 , 8 , 9 , }; int a2 [] = { 2 , 4 , 9 , 12 , }; int a3 [] = { 4 , 7 , 10 , 13 , }; int a4 [] = { 6 , 8 , 11 , 15 , }; vector < vector < int >> array ; array . push_back ( vector < int > ( a1 , a1 + 4 )); array . push_back ( vector < int > ( a2 , a2 + 4 )); array . push_back ( vector < int > ( a3 , a3 + 4 )); array . push_back ( vector < int > ( a4 , a4 + 4 )); Solution solu ; cout << solu . Find ( array , 7 ) << endl ; system ( "pause" ); return 0 ;