【LeetCode】707. Design Linked List（C++）

地址：https://leetcode.com/problems/design-linked-list/

描述：

Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node. If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.

Implement these functions in your linked list class:

• get(index) : Get the value of the index-th node in the linked list. If the index is invalid, return -1.
• addAtHead(val) : Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.
• addAtTail(val) : Append a node of value val to the last element of the linked list.
• addAtIndex(index, val) : Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted.
• deleteAtIndex(index) : Delete the index-th node in the linked list, if the index is valid.
  Example:

MyLinkedList linkedList = new MyLinkedList();
linkedList.addAtHead(1);
linkedList.addAtTail(3);
linkedList.addAtIndex(1, 2);  // linked list becomes 1->2->3
linkedList.get(1);            // returns 2
linkedList.deleteAtIndex(1);  // now the linked list is 1->3
linkedList.get(1);            // returns 3

Note:

• All values will be in the range of [1, 1000].
• The number of operations will be in the range of [1, 1000].
• Please do not use the built-in LinkedList library.

理解：

easy

思路：

带头节点的单链表

实现：

其中使用了LeetCode的LinkList数据结构

struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(nullptr) {}
};

实现如下

class MyLinkedList {
	ListNode* head;
	size_t length;
public:
	/** Initialize your data structure here. */
	MyLinkedList():head(new ListNode(INT_MIN)),length(0) {

	}

	/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
	int get(int index) {
		if (index<0 || index>static_cast<int>(length) - 1)
			return -1;
		ListNode *p = head->next;
		while (index) {
			p = p->next;
			--index;
		}
		return p->val;
	}

	/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
	void addAtHead(int val) {
		ListNode *p = new ListNode(val);
		p->next = head->next;
		head->next = p;
		++length;
	}

	/** Append a node of value val to the last element of the linked list. */
	void addAtTail(int val) {
		ListNode *p = head;
		while (p->next) {
			p = p->next;
		}
		p->next = new ListNode(val);
		++length;
	}

	/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
	void addAtIndex(int index, int val) {
		if (index<0 || index>static_cast<int>(length))
			return;
		ListNode *p = head;
		while (index) {
			p = p->next;
			--index;
		}
		ListNode* tmp = new ListNode(val);
		tmp->next = p->next;
		p->next = tmp;
		++length;
	}

	/** Delete the index-th node in the linked list, if the index is valid. */
	void deleteAtIndex(int index) {
		if (index<0 || index>static_cast<int>(length) - 1)
			return;
		ListNode *p = head;
		while (index) {
			p = p->next;
			--index;
		}
		ListNode* tmp = p->next;
		p->next = tmp->next;
		delete tmp;
		--length;
	}
};

这里还是踩了一个坑，mark一下
使用size_t类型记录大小，在为空的时候，比较index和length-1会出错。
无符号和有符号数不要混用。印象里C++ Primer有个地方写了无符号和带符号数的比较，找不到了。。。找到了来改。今天只找到35页说不要混用。（大概是如果无符号数范围和有符号数范围哪个大，怎么转换的，今天死活找不到了）
¬_¬感觉好像踩了好多次这个坑

后续

写之前想到了带尾指针的循环链表，但是脑子有点懵，翻了下书，当r->next==r的时候，为空链表。和这个差不多，删除尾节点的时候还需要单独写，不写了。去锻炼。