First Knowledge anti-compilation (Java article)
Look at the steps of linkedlist<>
Find the linkedlist<> in the code first
Mouse click Linkedlist<>, press the shortcut key F3, and then go to
Locate its parent class abstractsequentiallist<> and then continue to press F3 to enter
Find the iterator () method
Then continue F3 down, and you will find 3 methods inside of him "Hasnext (), Next (), remove ()"
Click this method in the following three methods of pressing F3
When calling the Hasnext method, compare the number of elements to size () and return a true if not equal;
After executing the Hasnext method, the system automatically calls the next () method
When this remove method is called, the current element is deleted and the cursor is assigned to the previous one,
Then rewrite the Lastret to 1 so that it can be used again next time.
First Knowledge anti-compilation