链表是一种通过指针串联在一起的线性结构,每一个节点由两部分组成,一个是数据域一个是指针域(存放指向下一个节点的指针),最后一个节点的指针域指向null(空指针的意思)。
203.移除链表元素 题目链接
思路:如图,只要将C节点的next指针 指向E节点就可以了
class Solution {
public ListNode removeElements(ListNode head, int val) {
if (head == null) {
return head;
}
// 虚拟头节点
ListNode dummy = new ListNode(-1, head);
ListNode pre = dummy;
ListNode cur = head;
while (cur != null) {
if (cur.val == val) {
pre.next = cur.next;
} else {
pre = pre.next;
}
cur = cur.next;
}
return dummy.next;
}
}
- 反转链表 题目链接
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
思路:
- 双指针法:设置虚拟头节点,然后两两迭代反转
class Solution {
public ListNode reverseList(ListNode head) {
ListNode pre = null;
ListNode cur = head;
ListNode temp = null;
while (cur != null) {
// 保存下一个节点
temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}
- 迭代法
class Solution {
public ListNode reverseList(ListNode head) {
return reverse(null, head);
}
public ListNode reverse(ListNode pre, ListNode cur){
if (cur == null) {
return pre;
}
// 保存下一个节点
ListNode temp = cur.next;;
cur.next = pre;
pre = cur;
cur = temp;
return reverse(pre, cur);
}
}
707.设计链表 题目链接
class ListNode {
int val;
ListNode next;
ListNode(){};
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
}
class MyLinkedList {
int size;
// 虚拟头节点
ListNode head;
public MyLinkedList() {
this.size = 0;
this.head = new ListNode(0, null);
}
public int get(int index) {
if (index < 0 || index >= this.size) {
return -1;
}
ListNode cur = head;
for (int i = 0; i <= index; i++) {
cur = cur.next;
}
return cur.val;
}
public void addAtHead(int val) {
this.addAtIndex(0, val);
}
public void addAtTail(int val) {
this.addAtIndex(this.size, val);
}
public void addAtIndex(int index, int val) {
if (index > this.size) {
return;
}
if (index < 0) {
index = 0;
}
// 找到index位置的前驱节点
ListNode pre = this.head;
for (int i = 0; i < index; i++) {
pre = pre.next;
}
ListNode toAdd = new ListNode(val, pre.next);
pre.next = toAdd;
this.size++;
}
public void deleteAtIndex(int index) {
if (index < 0 || index >= this.size) {
return;
}
ListNode pre = this.head;
for (int i = 0; i < index; i++) {
pre = pre.next;
}
pre.next = pre.next.next;
this.size--;
}
}