This week's theoretical lesson reviewed the contents of chapter 1-8, specifically through the example program Idtest review specific knowledge points.
Experiment through the learning set, the knowledge points are summarized as follows:
The 1.Map interface maps unique keywords to values.
The 2.MAP loop uses two basic operations: get () and put (). Use the put () method to add a value that specifies a keyword and value to the map. To get the value, you can call the Get () method by using the keyword as a parameter. The call returns the value.
Elements in 3.Set must be unique and cannot contain duplicate elements, but the element arrangement is not sequential.
Elements in 4.ArrayList are stored in memory in a static order, returning an array.
Elements in 5.LinkedList are dynamically stored in memory as a linked list, returning a collection.
6.List is an ordered set of elements that can contain duplicates.
7. Collection values accommodate objects (unlike arrays, arrays can hold basic data type data and objects) and contain objects that are instances of the object class.
8.Stack (Stack) is a subclass of vector (vectors), and the method of vector is suitable for stack.
9. The iterator interface is used extensively in this experiment, that is, requesting an iterator and repeatedly invoking the next method to access each element of the collection one at a time when Hasnext () returns True.
Specific details need to be found in the program. such as in this experiment exercise 9-2 program settest just start not to run out, later saw a classmate in the blog Park also released the same problem, according to the teacher commented I run the program, but the results are diversified, sometimes sorted after the output, sometimes not run, there is a run only the last sentence of the program output statement , and the output is 0 each time, regardless of whether there are duplicate words.
----Li Na
201671010116.2016-2017-10 "Java Programming" 11th Week study Summary