int main() {
int numbers[] = {2, 4, 6, 1, 3, 5, 7};
ReorderOddEven(numbers, 7);
for (int i = 0; i < 7; i++)
printf("%d\t", numbers[i]);
printf("\n");
return 0;
}
int main()
{
int a[5]={1,2,3,4,5};
ReorderOddEven(a,5,isEven);
for(int i=0;i<5;i++)
{
printf("%d",a[i]);
}
}
int main() {
int length = 5;
int a[] = {4, 6, 2, 9, -7};
ReorderOddEven(a, length);
for(int i = 0; i < length; ++i)
printf("%d\t",a[i]);
printf("\n");
return 0;
}
int _tmain(int argc, _TCHAR* argv[])
{
//print1ToMaxOfNDigits(10);
int arr[16];
srand((unsigned int)time(NULL));
for (int i=0;i<16;i++)
{
arr[i] = rand()%100;
std::cout << arr[i] << " ";
}
std::cout << std::endl;
ReorderOddEven(arr,16,IsEven);
for (int i=0;i<16;i++)
{
std::cout << arr[i] << " ";
}
LinkNode *pHead = new LinkNode;
pHead->value = 0;
pHead->next = NULL;
for (int i=1;i<10000;i++)
{
LinkNode *node = new LinkNode;
node->value = i;
node->next = pHead->next;
pHead->next = node;
}
std::cout <<std::endl<< FindKthToTail(pHead,4000)->value << std::endl;
while (pHead->next!=NULL)
{
LinkNode *node = pHead->next;
pHead->next = node->next;
delete node;
}
return 0;
}
