203移除链表元素
给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
思路:重点考虑特殊情况,头节点为空怎么办?头节点的值为val怎么办?元素全是val怎么办?
public ListNode removeElements(ListNode head, int val) {
while (head != null && head.val == val){//判断头节点是否为空,很重要
head = head.next;
}
if (head == null){
return head;
}
ListNode prev = head;
while (prev.next != null){
if (prev.next.val == val){
prev.next = prev.next.next;
} else {
prev = prev.next;//如果值不相等要选择下一个节点考查
}
}
return head;
}
使用虚拟头节点再做一遍,不需要考虑head的值为val的情况:
public ListNode removeElements2(ListNode head, int val) {
ListNode dymmyHead = new ListNode(-1);
dymmyHead.next = head;
ListNode prev = dymmyHead;
while (prev.next != null){
if (prev.next.val == val){
prev.next = prev.next.next;
} else {
prev = prev.next;
}
}
return dymmyHead.next;
}
707设计链表
没有使用dymmyHead,感觉有好多不容易考虑到的点。
后面再巩固;
没有使用dummyHead,调试过程有些艰难,但总算还是自己写出来了。
最大的两个卡住的点:
(1) size记录错误,太致命了——添加头节点和普通添加不要重复&头节点不能初始化成0。
(2) 题目含义没有看清楚,下标小于零添加到表头,下标小于零不能添加。
class MyLinkedList {
/*public static void main(String[] args) {
MyLinkedList linkedList = new MyLinkedList();
linkedList.addAtIndex(0,4);
System.out.println(linkedList.toString());
System.out.println("size= "+linkedList.size);
linkedList.addAtIndex(1,4);
System.out.println(linkedList.toString());
System.out.println("size= "+linkedList.size);
linkedList.deleteAtIndex(0);
System.out.println(linkedList.toString());
System.out.println("size= "+linkedList.size);
linkedList.deleteAtIndex(0);
System.out.println(linkedList.toString());
System.out.println("size= "+linkedList.size);
linkedList.get(0);
System.out.println(linkedList.toString());
}*/
@Override
public String toString() {
StringBuilder res = new StringBuilder();
ListNode cur = head;
while (cur != null){
res.append(cur.val + " ");
cur = cur.next;
}
return res.toString();
}
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;
}
}
private ListNode head;
private int size;
public MyLinkedList() {
head = null;
size = 0;
}
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) {
ListNode node = new ListNode(val,head);
//System.out.println("head=" + head.val);
head = node;
size++;
}
public void addAtTail(int val) {
if (head == null){ // 1
head = new ListNode(val);
} else {
ListNode prev = head;
while (prev.next != null){
prev = prev.next;
}
prev.next = new ListNode(val);
}
size++;
}
public void addAtIndex(int index, int val) {
if (index <= 0){
addAtHead(val);
} else if (index > size){//看清楚题目含义
return;
} else {
ListNode prev = head;
for (int i = 0; i < index - 1; i++) {
prev = prev.next;
}
prev.next = new ListNode(val, prev.next);
size++;
}
}
public void deleteAtIndex(int index) {
ListNode prev = head;
if (index < 0 || index >= size)
return;
if (index == 0){
head = head.next;
} else {
for (int i = 0; i < index - 1; i++) {
prev = prev.next;
}
prev.next = prev.next.next; // 2
}
size--;
}
}
206反转链表
题意:反转一个单链表。
示例: 输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
思路:之前做过,使用三个指针
public ListNode reverseList(ListNode head) {
// 之前做过,三个指针 prev cur next
ListNode prev = null, cur = head;//先不写这个,万一头节点为空怎么办? next = head.next;
while (cur != null){
ListNode next = cur.next;
cur.next = prev;
prev = cur;
cur = next;
}
return prev;
}