Reverse Linked List
unknown
c_cpp
20 days ago
659 B
3
Indexable
Never
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(x), next(next) {} * }; */ class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* prev=nullptr; ListNode* current=head; ListNode* next=nullptr; while(current!=nullptr) { next=current->next; current->next=prev; prev=current; current=next; } return prev; } };
Leave a Comment