203.移除链表元素
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
while (head != nullptr && head->val == val) {
ListNode* tmp = head;
head = head->next;
delete tmp;
}
ListNode* cur = head;
while (cur != nullptr && cur->next != nullptr) {
if (cur->next->val == val) {
ListNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
} else {
cur = cur->next;
}
}
return head;
}
};
707.设计链表
class MyLinkedList {
public:
struct LinkedNode {
int val;
LinkedNode* next;
LinkedNode(int val):val(val), next(nullptr) {}
};
MyLinkedList() {
dummyhead = new LinkedNode(0);
size = 0;
}
int get(int index) {
if (index < 0 || index > size - 1) return -1;
LinkedNode* cur = dummyhead->next;
while (index--) {
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* newnote = new LinkedNode(val);
newnote->next = dummyhead->next;
dummyhead->next = newnote;
size++;
}
void addAtTail(int val) {
LinkedNode* newnote = new LinkedNode(val);
LinkedNode* cur = dummyhead;
while (cur->next != nullptr) {
cur = cur->next;
}
cur->next = newnote;
size++;
}
void addAtIndex(int index, int val) {
if (index > size) return;
if (index < 0) index = 0;
LinkedNode* newnote = new LinkedNode(val);
LinkedNode* cur = dummyhead;
while (index--) {
cur = cur->next;
}
newnote->next = cur->next;
cur->next = newnote;
size++;
}
void deleteAtIndex(int index) {
if (index >= size || index < 0) return;
LinkedNode* cur = dummyhead;
LinkedNode* tmp;
while (index--) {
cur = cur->next;
}
tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
size--;
}
private:
LinkedNode* dummyhead;
int size;
};
206.反转链表
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* cur = head;
ListNode* pre = nullptr;
while (cur) {
ListNode* tmp = cur->next;
cur->next = pre;
pre = cur;
cur = tmp;
}
return pre;
}
};
递归写法
class Solution {
public:
ListNode* reverse(ListNode* cur, ListNode* pre) {
if (cur == nullptr) return pre;
ListNode* tmp = cur->next;
cur->next = pre;
return reverse(tmp, cur);
}
ListNode* reverseList(ListNode* head) {
return reverse(head, nullptr);
}
};