Created
August 24, 2019 15:26
-
-
Save u8989332/52a936484c531b673c5e7b3d801fc0ab to your computer and use it in GitHub Desktop.
LeetCode - 206 Reverse Linked List (C++ code)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
/** | |
* definition for singly-linked list. | |
* | |
*/ | |
struct ListNode { | |
int val; | |
ListNode *next; | |
ListNode(int x) : val(x), next(NULL) {} | |
}; | |
class Solution { | |
public: | |
ListNode* reverseList(ListNode* head) { | |
ListNode* newHead = NULL; | |
while(head!=NULL) | |
{ | |
ListNode* next = head->next; | |
head->next = newHead; | |
newHead = head; | |
head = next; | |
} | |
return newHead; | |
} | |
}; | |
void traverseNode(ListNode* head) | |
{ | |
cout << "Start traversal" << endl; | |
while(head!=NULL) | |
{ | |
cout << head->val << endl; | |
head = head->next; | |
} | |
cout << "Finish traversal" << endl; | |
} | |
int main() | |
{ | |
ListNode* node1 = new ListNode(1); | |
ListNode* node2 = new ListNode(2); | |
ListNode* node3 = new ListNode(3); | |
ListNode* node4 = new ListNode(4); | |
ListNode* node5 = new ListNode(5); | |
node1->next = node2; | |
node2->next = node3; | |
node3->next = node4; | |
node4->next = node5; | |
node5->next = NULL; | |
traverseNode(node1); | |
Solution sol; | |
ListNode* newHead = sol.reverseList(node1); | |
traverseNode(newHead); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment