203. 移除链表元素
找到
/**
* Definition for singly-linked list.
* public 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 Solution {
public ListNode removeElements(ListNode head, int val) {
ListNode nommy = new ListNode(0, head);
ListNode cur = nommy.next, pre = nommy;
while (cur != null) {
if (cur.val == val) {
pre.next = cur.next;
} else {
pre = pre.next;
}
cur = cur.next;
}
return nommy.next;
}
}
707. 设计链表
class ListNode {
int val;
ListNode next;
ListNode(){};
ListNode(int val){
this.val = val;
}
ListNode(int val, ListNode node){
this.val = val;
this.next = node;
}
}
class MyLinkedList {
int size;
ListNode head;
public MyLinkedList() {
size = 0;
head = new ListNode();
}
public int get(int index) {
if (index < 0 || index >= size) {
return -1;
}
ListNode cur = head;
for (int i = 0; i <= index; i++) {
cur = cur.next;
}
return cur.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 < 0 || index > size) {
// 插入最后一个节点索引为index
return;
}
// 1.找到要插入的位置
ListNode node = new ListNode(val);
ListNode pre = head;
for (int i = 0; i < index; i++) {
pre = pre.next;
}
// 2.插入节点
node.next = pre.next;
pre.next = node;
size++;
}
public void deleteAtIndex(int index) {
if (index < 0 || index >= size) {
// 删除节点需要没有索引为index的节点
return;
}
// 找到要删除节点的前一个节点
ListNode pre = head;
for (int i = 0; i < index; i++) {
pre = pre.next;
}
pre.next = pre.next.next;
size--;
}
}
206. 反转链表
题目链接
依次反转 [pre,cur] 两个节点
class Solution {
public ListNode reverseList(ListNode head) {
ListNode pre = null, cur = head;
ListNode temp = cur;
while (cur != null) {
temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}