203
删除节点写错了,没想到删除之后要等与null,插入节点没考虑到index小于0
/**
* 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* head_record = new ListNode();
head_record->next = head;
ListNode* current = head_record;
while(current->next != NULL){
if(current->next->val == val){
ListNode* tmp = current->next;
current->next = current->next->next;
delete tmp;
}else{
current = current->next;
}
}
head = head_record->next;
delete head_record;
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 >= size || index < 0){
return -1;
}
else{
LinkedNode* cur = dummyHead->next;
while(index--){
cur = cur->next;
}
return cur->val;
}
}
void addAtHead(int val) {
LinkedNode* tmp = new LinkedNode(val);
tmp->next = dummyHead->next;
dummyHead->next = tmp;
size++;
}
void addAtTail(int val) {
LinkedNode* tmp = new LinkedNode(val);
LinkedNode* cur = dummyHead;
while(cur->next != nullptr){
cur = cur->next;
}
cur->next = tmp;
size++;
}
void addAtIndex(int index, int val) {
if(index > size ){
return;
}
if(index < 0) index = 0;
LinkedNode* cur = dummyHead;
while(index--) {
cur = cur ->next;
}
LinkedNode* tmp = new LinkedNode(val);
tmp->next = cur->next;
cur->next = tmp;
size++;
}
void deleteAtIndex(int index) {
if (index >= size || index < 0) {
return;
}
LinkedNode* cur = dummyHead;
while(index--) {
cur = cur ->next;
}
LinkedNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
tmp = nullptr;
size--;
}
private:
int size;
LinkedNode* dummyHead;
};
/**
* Your MyLinkedList object will be instantiated and called as such:
* MyLinkedList* obj = new MyLinkedList();
* int param_1 = obj->get(index);
* obj->addAtHead(val);
* obj->addAtTail(val);
* obj->addAtIndex(index,val);
* obj->deleteAtIndex(index);
*/
206
/**
* 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* temp;
ListNode* cur = head;
ListNode* pre = nullptr;
while(cur) {
temp = cur->next;
cur->next = pre;
pre = cur;
cur = temp;
}
return pre;
}
};