hackerrank Day15: Linked List 1#include <iostream>2#include <cstddef>3usingnamespacestd;4classNode5{6public:7intdata;8Node *next;9Node(intd){10data=d;11next=NULL;12}13};14classSolution{15public:16Node* insert(Node *head,intdata)17{18Node *temp =newNode(data);19if(head ==NULL){20...
Nothing but admire: http://fisherlei.blogspot.com/2013/11/leetcode-linked-list-cycle-ii-solution.html classSolution {public: ListNode*detectCycle(ListNode *head) { ListNode dum(0); dum.next =head; ListNode*sp = &dum; ListNode*fp = &dum;while(sp &&fp) { sp= sp->next; fp= fp->nex...
45678910 An interview problem I encountered years ago.. 1AC classSolution {public:voiddeleteNode(ListNode*node) {if(!node)return; ListNode*p1 =node; ListNode*p2 = node->next;while(p1 &&p2) { p1->val = p2->val;if(!p2->next) { p1->next =nullptr;return; } p1=p2; p2= p2->next;...
classSolution {public: ListNode* oddEvenList(ListNode*head) {if(!head || !head->next)returnhead; ListNode*pOddHead = head, *pEvenHead = head->next; ListNode*pOddTail = pOddHead, *pEvenTail =pEvenHead; ListNode*pOddLast =pOddTail;while(pOddTail) { ListNode*pNxtOdd = pOddTail->next ?