遍歷元組時

array[SIZE] = {1, 2, 3, 4, 5, 6};

for ( int i = 0; i < SIZE; i++)

或者array[SIZE] = {1, 2, 3, 4, 5, 6, -1}, 其中 -1 是不可能出現(xiàn)的數(shù)據(jù)

for ( int i = 0; i != -1; i++)

array[SIZE] = {1, 2, 3, 4, 5, 6};

int *p = array[0];

for ( int i = 0; *p != -1; *p++)

while ( *p != -1)

??? *p++;