xevion/contest
1
0
Fork 0
mirror of https://github.com/Xevion/contest.git synced 2025-12-13 12:11:20 -06:00
Code Issues Packages Projects Releases Wiki Activity

test 01 question 36 LinkedList stuff

Browse Source
This commit is contained in:
Xevion
2019-12-12 02:52:34 -06:00
parent 6ece0a35b7
commit 4a12a148b4
1 changed files with 12 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
uil/uil-practice-armstrong/test-1/EXPLANATIOn.md
View File

@@ -557,8 +557,20 @@ For example, the numbers 4, 3, 7, 8, and 16 are put into a data structure that o
## Question 35 ## Question 35
Another trivia-like question, the initial capacity for an ArrayList (if not specified) is 10.
## Question 36 ## Question 36
A LinkedList offers a massive selection of methods useful for manipulating it.
Some of the methods, one can decipher the meaning of, like `offerFirst` and `offerLast`, but you won't know `offer`, at least not immediately.
`offer(E e)` adds the specified element to the end of the list.
`offerFirst(E e)` adds the specified element to the start of the list.
`offerLast(E e)` adds the specified element to the end of the list.
`offerLast(E e)` has no discernable difference from `offer(E e)`.
With this, one can easily build the list from the inside out with each method call.
## Question 37 ## Question 37
## Question 38 ## Question 38