链表
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) {}
};
vector<int> list = {1, 3, 4, 7, 1, 2, 6};
ListNode *head = new ListNode;
ListNode *p = head;
int len = list.size();
for (int i = 0; i < len; ++i) {
ListNode *q = new ListNode;
q->val = list[i];
q->next = nullptr;
p->next = q;
p = p->next;
}
deleteMiddle(head->next);
void display(ListNode *L) {
while (L) {
cout << L->val << " ";
L = L->next;
}
cout << endl;
}
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) || index < 0) {
return -1;
}
LinkedNode* cur = _dummyHead->next;
while(index--){
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* newNode = new LinkedNode(val);
newNode->next = _dummyHead->next;
_dummyHead->next = newNode;
_size++;
}
void addAtTail(int val) {
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while(cur->next != nullptr){
cur = cur->next;
}
cur->next = newNode;
_size++;
}
void addAtIndex(int index, int val) {
if (index > _size) {
return;
}
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while(index--) {
cur = cur->next;
}
newNode->next = cur->next;
cur->next = newNode;
_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;
_size--;
}
void printLinkedList() {
LinkedNode* cur = _dummyHead;
while (cur->next != nullptr) {
cout << cur->next->val << " ";
cur = cur->next;
}
cout << endl;
}
private:
int _size;
LinkedNode* _dummyHead;
};
MyLinkedList linkedList = new MyLinkedList();
linkedList.addAtHead(1);
linkedList.addAtTail(3);
linkedList.addAtIndex(1,2);
linkedList.get(1);
linkedList.deleteAtIndex(1);
linkedList.get(1);
树 root
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
vector<int> list = {5, 1, 2, 3, 0, 6, 4};
int len = list.size();
TreeNode *root = new TreeNode;
TreeNode *p = root;
queue<TreeNode *> que;
root->val = list[0];
root->left = nullptr;
root->right = nullptr;
que.push(root);
int tp = 1;
while (tp < len) {
TreeNode *fo = que.front();
que.pop();
TreeNode *le = new TreeNode;
TreeNode *ri = new TreeNode;
int lval = list[tp++];
int rval = list[tp++];
if (lval != 0)
le->val = lval, le->left = le->right = nullptr;
else le = nullptr;
if (rval != 0)
ri->val = rval, ri->left = ri->right = nullptr;
else ri = nullptr;
fo->left = le;
fo->right = ri;
que.push(le);
que.push(ri);
}