ToDestination

#include <iostream>
using namespace std;

#define M 2
#define N 3

int main()
{
    int a[M][N] = {1,2,3,4,5,4}; 
    cout<<&(a[0])<<endl;    //00DCFA64
    cout<<&(a[0])+1<<endl;  //00DCFA70,offest:12
    cout<<a<<endl;          //00DCFA64,a=&(a[0]),
    cout<<a+1<<endl;        //00DCFA64

    cout<<&(a[0][0])<<endl;   //00DCFA64
    cout<<&(a[0][0])+1<<endl; //00DCFA68,offest:4
    
    int* ptr = (int*)(a);  //ptr=&(a[0][0])
    cout<<ptr<<endl;       //00DCFA64

    //for(int i = 0; i < sizeof(a)/sizeof(int); i++)
    //{
    //    if((*ptr++) == 4)
    //    {
    //        cout << "i=" << i/N << ", j=" << i%N << endl;
    //    }
    //}
    return 0;
}

#include <iostream>
using namespace std;

// 二維數組matrix中，每一行都從左到右遞增排序，
// 每一列都從上到下遞增排序
//判斷一個整數是否在該二維數組中
bool Find(int* matrix, int rows, int columns, int number)
{
    bool found = false;

    if(matrix != NULL && rows > 0 && columns > 0)
    {
        int row = 0;
        int column = columns - 1;
        while(row < rows && column >=0)
        {
            if(matrix[row * columns + column] == number)
            {
                found = true;
                break;
            }
            else if(matrix[row * columns + column] > number)
                -- column;
            else
                ++ row;
        }
    }

    return found;
}