Shulou(Shulou.com)06/02 Report--

This article mainly introduces "the trap case analysis of ArrayList". In the daily operation, I believe that many people have doubts about the trap case analysis of ArrayList. The editor consulted all kinds of data and sorted out simple and easy-to-use operation methods. I hope it will be helpful to answer the doubts of "trap case analysis of ArrayList". Next, please follow the editor to study!

Import java.util.ArrayList; public class ArrayListTest {public static void main (String [] args) {/ / an object linked list ArrayList strAl=new ArrayList (); strAl.add ("a"); strAl.add ("b"); strAl.add ("c"); strAl.add ("d") / / to delete all indexes of the object linked list ArrayList indexes=new ArrayList (); indexes.add (0); indexes.add (2); / / delete for one by one (int I = 0; I < indexes.size (); iTunes +) {strAl.remove (indexes.get (I)) } / / print the number of * objects System.out.println (strAl.size ());}} / / who can not run the code and know how much it is printed out? at this point, the study on "trap instance analysis of ArrayList" is over, hoping to solve everyone's doubts. The collocation of theory and practice can better help you learn, go and try it! If you want to continue to learn more related knowledge, please continue to follow the website, the editor will continue to work hard to bring you more practical articles!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.