1.链表移除
给你一个链表的头节点
head
和一个整数val
,请你删除链表中所有满足Node.val == val
的节点,并返回 新的头节点 。
tips:虚拟头结点+快慢指针
class Solution {
public ListNode removeElements(ListNode head, int val) {
if (head == null){
return head;
}
ListNode damp = new ListNode(-1,head);//虚拟头结点
ListNode pre = damp;
ListNode cur = head;//双指针
while(cur != null){
if(cur.val == val){
pre.next = cur.next;
}else {
pre = cur;
}
cur = cur.next;
}
return damp.next;
}
}
2.设计链表
实现
MyLinkedList
类:
MyLinkedList()
初始化MyLinkedList
对象。int get(int index)
获取链表中下标为index
的节点的值。如果下标无效,则返回-1
。void addAtHead(int val)
将一个值为val
的节点插入到链表中第一个元素之前。在插入完成后,新节点会成为链表的第一个节点。void addAtTail(int val)
将一个值为val
的节点追加到链表中作为链表的最后一个元素。void addAtIndex(int index, int val)
将一个值为val
的节点插入到链表中下标为index
的节点之前。如果index
等于链表的长度,那么该节点会被追加到链表的末尾。如果index
比长度更大,该节点将 不会插入 到链表中。void deleteAtIndex(int index)
如果下标有效,则删除链表中下标为index
的节点。
addTail和addAthead可以直接调用addAtIndex函数,全程记录size
class MyLinkedList {
int size;
ListNode head;
public MyLinkedList() {
size = 0;//全局变量
head = new ListNode(0);//head生成时的size为0,不计入链表长度
}
public int get(int index) {
if (index >= size || index < 0){
return -1;
}
ListNode pre = head;
for (int i = 0; i <= index; i++){
pre = pre.next;
}
return pre.val;
}
public void addAtHead(int val) {
addAtIndex(0, val);
}
public void addAtTail(int val) {
addAtIndex(size, val);
}
public void addAtIndex(int index, int val) {
if (index > size || index < 0){
return;
}
size++;
ListNode cur = head;
ListNode addIndex = new ListNode(val);
for (int i = 0; i < index; i++){
cur = cur.next;
}
addIndex.next = cur.next;
cur.next = addIndex;
}
public void deleteAtIndex(int index) {
if(index >= size || index < 0){
return;
}
size--;
if (index == 0) {
head = head.next;
return;
}
ListNode cur = head;
for (int i = 0; i < index; i++){
cur = cur.next;
}
cur.next = cur.next.next;
}
}
/**
* 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);
*/
3.反转链表
class Solution {
public ListNode reverseList(ListNode head) {
if (head == null){
return head;
}
ListNode pre = new ListNode();
ListNode cur = new ListNode();
pre = null;
cur = head;
while (cur != null){
ListNode temp = new ListNode();
temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}