leetcode#27 Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.

leetcode#27 Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.

leetcode#328 Odd Even Linked List

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

leetcode#148 Sort List

Sort a linked list in O(n log n) time using constant space complexity.

leetcode#147 Insertion Sort List

Sort a linked list using insertion sort.

leetcode#143 Reorder List

Given a singly linked list L: L0 L1 … Ln-1 Ln,
reorder it to: L0 Ln L1 Ln-1 L2 Ln-2…

leetcode#138 Copy List With Random Pointer

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Java Concurrency——并发

如果视而不见，就会遭其反噬。

Java IO——输入输出

如果缺乏历史的眼光，很快我们就会对什么时候该使用哪些类，以及什么时候不该使用它们而感到迷惑。

Java Container——容器

0 容器的出现

如果一个程序值包含固定数量且生命周期已知的对象，那么算不上一个复杂的程序。