在一個二維陣列中,每一行都按照從左到右遞增的順序排序,每一列都按照從上到下遞增的順序排序。請按成 一個函式,輸入這樣一個二維陣列和一個整數,判斷陣列中是否含有該整數
阿新 • • 發佈:2019-01-04
</pre><pre name="code" class="cpp"><span style="font-size:18px;">#include<iostream> using namespace std; bool IsExitNum(int arr[][5], int row,int col, int num) { bool find = false; if (arr == NULL || (row < 0 && col < 0)) { return find; } int _row = 0; int _col = col-1; while (_row < row && _col >= 0) { if (arr[_row][_col] > num) { --_col; } else if (arr[_row][_col] < num) { ++_row; } else { find = true; return find; } } return find; } //測試用例:1.9,exit; // 2.8,no exit; //左上角 3.0, exit; //右下角 4.29,exit; //左下角 5.12,exit; int main() { int arr[4][5] = { { 0, 3, 7, 9, 13 }, { 2, 5, 11, 13, 17 }, { 9, 14, 15, 19, 21 }, { 12, 18, 20, 25, 29 } }; bool ret = IsExitNum(arr, 4, 5, 9); if (ret) { cout << "9 exit" << endl; } else { cout << "9 no exit" << endl; } ret = IsExitNum(arr, 4, 5, 8); if (ret) { cout << "8 exit" << endl; } else { cout << "8 no exit" << endl; } ret = IsExitNum(arr, 4, 5, 0); if (ret) { cout << "0 exit" << endl; } else { cout << "0 no exit" << endl; } ret = IsExitNum(arr, 4, 5, 29); if (ret) { cout << "29 exit" << endl; } else { cout << "29 no exit" << endl; } ret = IsExitNum(arr, 4, 5, 12); if (ret) { cout << "12 exit" << endl; } else { cout << "12 no exit" << endl; } return 0; }</span>