arraylist

how to work with Multidimensional arraylist?

陌路散爱 提交于 2020-01-15 22:50:38
问题 Hey guys sorry i'm a noob at java but im trying to make something and i need a multidimensional array list. It must be implemented into the following code: public static void OpenFile() { ArrayList<ArrayList<String>> array = new ArrayList<ArrayList<String>>(); int retrival = chooser.showOpenDialog(null); if (retrival == JFileChooser.APPROVE_OPTION) { try (BufferedReader br = new BufferedReader(new FileReader( chooser.getSelectedFile()))) { String sCurrentLine; while ((sCurrentLine = br

how to work with Multidimensional arraylist?

好久不见. 提交于 2020-01-15 22:50:06
问题 Hey guys sorry i'm a noob at java but im trying to make something and i need a multidimensional array list. It must be implemented into the following code: public static void OpenFile() { ArrayList<ArrayList<String>> array = new ArrayList<ArrayList<String>>(); int retrival = chooser.showOpenDialog(null); if (retrival == JFileChooser.APPROVE_OPTION) { try (BufferedReader br = new BufferedReader(new FileReader( chooser.getSelectedFile()))) { String sCurrentLine; while ((sCurrentLine = br

Java集合源码解析之ArrayList

拟墨画扇 提交于 2020-01-15 20:17:39
uml类图: 基本简介: ArrayList的底层数据结构是数组,所以内存需要为arrayList保证有足够的连续的内存空间。 添加操作会导致数组扩容,数组扩容比较消耗性能。 非尾部的添加和删除元素操作会涉及数组元素的移动,也比较消耗性能。 由于是数组结构,所以可以通过下标进行随机访问,时间复杂度为O(1),性能好。 这里只讲部分重要的方法: modCount成员在AbstractList中定义,这个记录着集合对象的修改次数,是failfast机制的判断依据。 failfast机制请看:https://blog.csdn.net/qq_40837310/article/details/103993535 public class ArrayList<E> extends AbstractList<E> implements List<E>, RandomAccess, Cloneable, java.io.Serializable { private static final long serialVersionUID = 8683452581122892189L; //默认的数组大小 private static final int DEFAULT_CAPACITY = 10; //一个类共享的空数组 private static final Object[] EMPTY

Java2019最新面试题

落爺英雄遲暮 提交于 2020-01-15 17:19:38
2019最新整理JAVA面试题附答案 作者:Jack 包含的模块: 本文分为十九个模块,分别是:Java 基础、容器、多线程、反射、对象拷贝、Java Web 、异常、网络、设计模式、Spring/Spring MVC、Spring Boot/Spring Cloud、Hibernate、MyBatis、RabbitMQ、Kafka、Zookeeper、MySQL、Redis、JVM 如下图所示: 共包含 208 道面试题,本文的宗旨是为读者朋友们整理一份详实而又权威的面试清单 ==================================================== 一. Java 基础模块 1.JDK 和 JRE 有什么区别? JDK:Java Development Kit 的简称,Java 开发工具包,提供了 Java 的开发环境和运行环境。 JRE:Java Runtime Environment 的简称,Java 运行环境,为 Java 的运行提供了所需环境。 具体来说 JDK 其实包含了 JRE,同时还包含了编译 Java 源码的编译器 Javac,还包含了很多 Java 程序调试和分析的工具。简单来说:如果你需要运行 Java 程序,只需安装 JRE 就可以了,如果你需要编写 Java 程序,需要安装 JDK。 2.== 和 equals 的区别是什么

Remove MidiEvent from Track fails - MIDI / Java

拈花ヽ惹草 提交于 2020-01-15 14:18:09
问题 A user has the ability to generate a set of MIDI events which are in turn added to an ArrayList and then iterated through and added to a Track object, waiting to be played. I'm trying to remove all of the events that are in a track, I do this by iterating through all of the MIDI Events in a collection and use the "CreateNoteOnEvent"/"CreateNoteOffEvent" in the .remove() method. For some reason the method always returns as false, as in it can't find the event to delete or that it has failed to

List接口,ArrayList、LinkedList

谁都会走 提交于 2020-01-15 13:09:28
/*List接口概述(java.util.list) 1.有序的 collection(也称为序列)。存放和取出的顺序一样的,有下标 * 2.可以有重复的元素 * * ArrayList(实现类): * 1.底层数据结构是数组,查询快,增删慢(就是顺序存储的特点) * * * */ public class Demo1 { public static void main(String[] args) { //创建List对象 List list1 = new ArrayList(); //ArrayList list1 = new ArrayList();这样也不会报错,说明list和ArrayList一样 list1.add("java"); list1.add("c++"); list1.add("123"); //遍历 Iterator i1 = list1.iterator(); while (i1.hasNext()) { System.out.println(i1.next()); } //List特有的方法 //1.void add(int index,E element)将指定元素添加到指定下标处,下标从0开始 list1.add(0, "php"); System.out.println(list1); //2.E remove(int index

电话本管理系统 ArrayList版

╄→尐↘猪︶ㄣ 提交于 2020-01-15 10:30:34
题目参考: https://blog.csdn.net/Amber_technology/article/details/103818151 本文代码是在其基础上进行的改进。 主要修改:使用ArrayList替换了数组,简化了代码量,提高了代码的可用性。 public class Telephone { //变量 private String name; private String sex; private int age; private String tel; private String QQ; private String addr; //方法 //set & get方法 public String getName() { return name; } public void setName(String name) { this.name = name; } public String getSex() { return sex; } public void setSex(String sex) { this.sex = sex; } public int getAge() { return age; } public void setAge(int age) { this.age = age; } public String getTel() { return tel

ArrayList的扩容机制以及常用方法源码分析

六眼飞鱼酱① 提交于 2020-01-15 09:05:05
一直想记录自己的学习过程,但始终没有付出实际行动,说来惭愧 感谢您的关注,持续更新,欢迎留言交流~ 前言: 虽然面试我们通常是讲ArrayList和数组的区别,但小编觉得,我们有必要去了解一下ArrayList,在我们日常开发上,ArrayList也算得上是一种常用的集合了,接下来就和小编一起来扯下淡吧~ 话不多说,直接上源码,以下源码基于JDK1.8 让我们先来看看 ArrayList list = new ArrayList(); list.add("小编是个秃顶的大叔~"); // 默认为 0 private int size; /** * Appends the specified element to the end of this list. * @param e element to be appended to this list * @return <tt>true</tt> (as specified by {@link Collection#add}) */ public boolean add(E e) { // size[0] + 1 当作参数传入方法 ensureCapacityInternal(size + 1); elementData[size++] = e; return true; }

How to sort data of ArrayList of hashmap<String , String> on The Basis of Date

家住魔仙堡 提交于 2020-01-15 07:57:06
问题 i have sorted the data on the basis of name. but when i am going to sort the data of arraylist of hash map on the basis of "date", i have no idea how to solve it. my Method for sort by name is given below. protected ArrayList<HashMap<String, String>> setListOrderByName(ArrayList<HashMap<String, String>> menuItems2) { Collections.sort(menuItems2, new Comparator<HashMap<String, String>>() { public int compare(HashMap<String, String> mapping1, HashMap<String, String> mapping2) { return mapping1

java add items to arraylist at random time intervals

点点圈 提交于 2020-01-15 07:47:12
问题 trying to add an item at random time intervals. I was thinking I need to start when i is equal to arriveTime, once that is met I need to create a new random arrival and add i (otherwise it will not happen again as i is already past arrival. So I add another if, once that is met create new arrival time and add i again. pseudocode seems to make sense, code not so much, any help is appreciated. ArrayList<Integer> q = new ArrayList<Integer>(); Random r = new Random(); int arrivals = 0; for (int i