一定不是因为懒才不写设计链表的
思路:考虑两种情况,移除头结点和移除非头结点,C++要手动释放内存
ListNode* removeElements(ListNode* head, int val) {
//移除头结点
while(head != NULL && head->val == val){
ListNode* tmp = head;
head = head->next;
delete tmp;
}
//移除非头结点
ListNode* cur = head;
while(cur != NULL && cur->next !=NULL){
if(cur->next->val == val ){
ListNode* tmp = cur -> next;
cur->next = cur->next->next;
elete tmp;
}else{
cur = cur->next;
}
}
return head;
}
思路:前后指针,从头开始遍历链表,后一个指针指向前一个指针,返回前一个指针
ListNode* reverseList(ListNode* head) {
ListNode* pre = NULL;
ListNode* cur = head;
ListNode* tmp;
while(cur){
tmp = cur->next;
cur->next = pre;//翻转
pre = cur;//pre指针前移
cur = tmp;//cur指针前移
}
return pre;
}