题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {//双指针
ListNode* cur = pHead;
ListNode* nxt = NULL;
ListNode* tmp;
while(cur){
tmp = cur->next;
cur->next = nxt;
nxt = cur;
cur = tmp;
}
return nxt ;
}
};
查看17道真题和解析