- void findKthNode(PTRNODE head, int k)
- {
- if(head == NULL)
- return;
- PTRNODE ptr = head, ptrK = head;
- int count = 0;
- while(ptrK != NULL)
- {
- count++;
- if(count > k)
- ptr = ptr->next;
- ptrK = ptrK->next;
- }
- cout << "result is: " << ptr->value << endl;
- }
寻找倒数第K个节点...
最新推荐文章于 2021-08-08 20:05:31 发布