设计链表
描述
-
你可以选择使用单链表或者双链表,设计并实现自己的链表
-
单链表中的节点应该具备两个属性:val 和 next 。val 是当前节点的值,next 是指向下一个节点的指针/引用
-
如果是双向链表,则还需要属性 prev 以指示链表中的上一个节点。假设链表中的所有节点下标从 0 开始
-
实现 MyLinkedList 类:
MyLinkedList()初始化 MyLinkedList 对象int get(int index)获取链表中下标为 index 的节点的值。如果下标无效,则返回 -1void addAtHead(int val)将一个值为 val 的节点插入到链表中第一个元素之前。在插入完成后,新节点会成为链表的第一个节点void addAtTail(int val)将一个值为 val 的节点追加到链表中作为链表的最后一个元素void addAtIndex(int index, int val)将一个值为 val 的节点插入到链表中下标为 index 的节点之前。如果 index 等于链表的长度,那么该节点会被追加到链表的末尾。如果 index 比长度更大,该节点将 不会插入 到链表中void deleteAtIndex(int index)如果下标有效,则删除链表中下标为 index 的节点
示例
输入
["MyLinkedList", "addAtHead", "addAtTail", "addAtIndex", "get", "deleteAtIndex", "get"]
[[], [1], [3], [1, 2], [1], [1], [1]]
输出
[null, null, null, null, 2, null, 3]
解释
MyLinkedList myLinkedList = new MyLinkedList();
myLinkedList.addAtHead(1);
myLinkedList.addAtTail(3);
myLinkedList.addAtIndex(1, 2); // 链表变为 1->2->3
myLinkedList.get(1); // 返回 2
myLinkedList.deleteAtIndex(1); // 现在,链表变为 1->3
myLinkedList.get(1); // 返回 3
提示
- 0 <= index, val <= 1000
- 请不要使用内置的 LinkedList 库
- 调用 get、addAtHead、addAtTail、addAtIndex 和 deleteAtIndex 的次数不超过 2000
Typescript 版算法实现
1 ) 方案1: 单向链表
class ListNode {
val: number;
next: ListNode | null;
constructor(val = 0, next = null) {
this.val = val;
this.next = next;
}
}
class MyLinkedList {
size: number;
head: ListNode
constructor() {
this.size = 0;
this.head = new ListNode(0);
}
get(index: number): number {
if (index < 0 || index >= this.size) {
return -1;
}
let cur = this.head;
for (let i = 0; i <= index; i++) {
cur = cur.next;
}
return cur.val;
}
addAtHead(val: number): void {
this.addAtIndex(0, val);
}
addAtTail(val: number): void {
this.addAtIndex(this.size, val);
}
addAtIndex(index: number, val: number): void {
if (index > this.size) {
return;
}
index = Math.max(0, index);
this.size++;
let pred = this.head;
for (let i = 0; i < index; i++) {
pred = pred.next;
}
let toAdd = new ListNode(val);
toAdd.next = pred.next;
pred.next = toAdd;
}
deleteAtIndex(index: number): void {
if (index < 0 || index >= this.size) {
return;
}
this.size--;
let pred = this.head;
for (let i = 0; i < index; i++) {
pred = pred.next;
}
pred.next = pred.next.next;
}
}
/**
* Your MyLinkedList object will be instantiated and called as such:
* var obj = new MyLinkedList()
* var param_1 = obj.get(index)
* obj.addAtHead(val)
* obj.addAtTail(val)
* obj.addAtIndex(index,val)
* obj.deleteAtIndex(index)
*/
2 )方案2:双向链表
class ListNode1 {
val: number;
next: ListNode1 | null;
prev: ListNode1 | null;
constructor(val = 0, next = null, prev = null) {
this.val = val;
this.next = next;
this.prev = prev;
}
}
class MyLinkedList {
size: number;
head: ListNode1;
tail: ListNode1;
constructor() {
this.size = 0;
this.head = new ListNode1(0);
this.tail = new ListNode1(0);
this.head.next = this.tail;
this.tail.prev = this.head;
}
get(index: number): number {
if (index < 0 || index >= this.size) {
return -1;
}
let curr;
if (index + 1 < this.size - index) {
curr = this.head;
for (let i = 0; i <= index; i++) {
curr = curr.next;
}
} else {
curr = this.tail;
for (let i = 0; i < this.size - index; i++) {
curr = curr.prev;
}
}
return curr.val;
}
addAtHead(val: number): void {
this.addAtIndex(0, val);
}
addAtTail(val: number): void {
this.addAtIndex(this.size, val);
}
addAtIndex(index: number, val: number): void {
if (index > this.size) {
return;
}
index = Math.max(0, index);
let pred, succ;
if (index < this.size - index) {
pred = this.head;
for (let i = 0; i < index; i++) {
pred = pred.next;
}
succ = pred.next;
} else {
succ = this.tail;
for (let i = 0; i < this.size - index; i++) {
succ = succ.prev;
}
pred = succ.prev;
}
this.size++;
const toAdd = new ListNode1(val);
toAdd.prev = pred;
toAdd.next = succ;
pred.next = toAdd;
succ.prev = toAdd;
}
deleteAtIndex(index: number): void {
if (index < 0 || index >= this.size) {
return;
}
let pred, succ;
if (index < this.size - index) {
pred = this.head;
for (let i = 0; i < index; i++) {
pred = pred.next;
}
succ = pred.next.next;
} else {
succ = this.tail;
for (let i = 0; i < this.size - index - 1; i++) {
succ = succ.prev;
}
pred = succ.prev.prev;
}
this.size--;
pred.next = succ;
succ.prev = pred;
}
}
/**
* Your MyLinkedList object will be instantiated and called as such:
* var obj = new MyLinkedList()
* var param_1 = obj.get(index)
* obj.addAtHead(val)
* obj.addAtTail(val)
* obj.addAtIndex(index,val)
* obj.deleteAtIndex(index)
*/
4252



被折叠的 条评论
为什么被折叠?



