In a stack, we only ever append to or remove from the end which makes an ArrayList much more appealing to implement a stack.' This is nonsense, LinkedList is good for adding / removing first / last element, while ArrayList is suitable for random access. Bt k khi no c mt i tng c to, n s c to lu b nh Heap. Heap memory l b nh c s dng bi Java Runtime cp pht b nh cho cc i tng (object) v String.
#Heap vs stack java code#
Forgive me for adding an answer to such an old question - The current answer is great, but misses a couple of edge cases because of static code and Java 8 updates. Stack memory allocation is considered safer as compared to heap memory allocation because the data stored can only be accessed by the owner thread. 'Linked lists are good for inserting and removing elements at random positions. Phn bit Heap memory v Stack memory trong java.
0 kommentar(er)
