LinkedList 201604 题目小结

最新推荐文章于 2023-09-14 16:11:27 发布

eatbanli

最新推荐文章于 2023-09-14 16:11:27 发布

阅读量234

点赞数

分类专栏：总结 Leetcode刷题

本文链接：https://blog.csdn.net/eatbanli/article/details/56003685

版权

Leetcode刷题同时被 2 个专栏收录

75 篇文章 0 订阅

订阅专栏

总结

10 篇文章 0 订阅

订阅专栏

234 LinkedList234PalindromeLinkedList

Question:
Why my code return false when comparing negative numbers like followings
[-16557,-8725,-29125,28873,-21702,15483,-28441,-17845,-4317,-10914,-10914,-4317,-17845,-28441,15483,-21702,28873,-29125,-8725,-16557]

Answer:
I use the ArrayList, Interger as on object, can only compare numbers between 2^7 to -2^7+1. So, for the object, we should use equals().

Further Question:
? How do we write equals() for Compare method?

203 RemoveLinkedListElements

1. Forgot move the`curr`‘point’ to the next

when other if statement added

2. Usage of !=Null

We can use .next and .next.next to delete elements, but that means the current and next should be not null.
——>
If we use .next.nextto for remove / delete, the curr = curr.nextshould be in the else statement

19 RemoveNthNodeFromEndOfList

自己第一反应做法是reverse list

1. Forgot the specialty of removing head element

2. if reverse you have to reverse back

看了一个solution的第一句话就晓得了通用办法，存在V2

1. 对于删除头结点的判断，嵌套的if else太过冗余，想想别的方法 4/15/2016

后来发现想多了。head = head.next 包含了head = null这种情况

//Create the two pointers
        ListNode faster = head;
        ListNode slower = head;
        for (int i = 0; i < n; i++) {
            faster = faster.next;
        }
//Find the to-be-delete element (slower)
        if (faster == null) {//delete the head      
                head = head.next;
        } else  {//not delete head
            while (faster.next != null) {       
                faster = faster.next;
                slower = slower.next;
            }
            slower.next = slower.next.next;
        }