203.移除链表元素
1.题目链接:203.remove-linked-list-elements - 力扣(LeetCode)
2.解题关键:
遍历列表,遇到目标值节点,将此目标节点的上一个节点的指针域指向此目标节点的下一个节点。
3.代码示例:
/**
* 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* removeElements(ListNode* head, int val) {
ListNode* dummyhead = new ListNode(0);
dummyhead->next = head;
ListNode* cur = dummyhead;
while(cur->next!=NULL){
if(cur->next->val==val){
ListNode* temp = cur->next;
cur->next = cur->next->next;
delete temp;
}
else{
cur = cur->next;
}
}
head = dummyhead->next;
delete dummyhead;
return head;
}
};
707.设计链表
1.题目链接:707.design-linked-list - 力扣(LeetCode)
2.解题关键:
注意细节!!!
3.代码示例:
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 > (_size-1) || _size==0 || index < 0){
return -1;
}
LinkedNode* cur;
cur = _dummyHead->next;
while(index--){
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* newHead = new LinkedNode(val);
LinkedNode* temp = _dummyHead->next;
_dummyHead->next = newHead;
newHead->next = temp;
_size++;
}
void addAtTail(int val) {
LinkedNode* newTail = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while(cur->next != nullptr){
cur = cur->next;
}
cur->next = newTail;
_size++;
}
void addAtIndex(int index, int val) {
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
if (index>_size){
return;
}
if(index<0){
index = 0;
}
while(index--){
cur = cur->next;
}
newNode->next = cur->next;
cur->next = newNode;
_size++;
}
void deleteAtIndex(int index) {
LinkedNode* cur = _dummyHead;
if (index>=_size){
return;
}
if(index<0){
index = 0;
}
while(index--){
cur = cur->next;
}
LinkedNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
tmp = nullptr;
_size--;
}
private:
int _size;
LinkedNode* _dummyHead;
};
206.反转链表
1.题目链接:206.reverse-linked-list - 力扣(LeetCode)
2.解题关键:
temp 用来遍历链表;
cur用来调转方向;
pre用来记录已调转好方向的链表;
3.代码示例:
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* cur = head;
ListNode* temp = head;
ListNode* pre = NULL;
while(temp!=nullptr){
temp = temp->next;
cur->next =pre;
pre = cur;
cur = temp;
}
return pre;
}
};