1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
|
class Solution { public: ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) { if (pListHead == nullptr || k == 0) { return nullptr; } else { ListNode *left = pListHead, *right = pListHead; while (k > 1) { if (right->next == nullptr) { left = nullptr; break; } else { right = right->next; } k--; } while (right->next != nullptr) { right = right->next; left = left->next; } return left; } } };
|