1.检测ArrayList和LinkedList存差效率
package Lx22.Day0707;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
public class Homework1 {
public static void main(String[] args) {
List<Integer> arrayInsertList = new ArrayList<>();
List<Integer> linkedInsertList = new LinkedList<>();
for (int i = 0; i < 100000; i++) {
arrayInsertList.add(i);
linkedInsertList.add(i);
}
//ArrayList插入耗时
Long arrayInsertStart1 = System.currentTimeMillis();//获取从1970-1-1 0:0:0 到现在的毫秒
for (int i = 0; i < 100000; i++) {
arrayInsertList.add(500,i);
}
Long arrayInsertEnd1 = System.currentTimeMillis();
System.out.println("ArrayList插入耗时:" + (arrayInsertEnd1 - arrayInsertStart1) + "ms");
//ArrayList插入耗时
Long arrayInsertStart2 = System.currentTimeMillis();
for (int i = 0; i < 100000; i++) {
linkedInsertList.add(500,i);
}
Long arrayInsertEnd2 = System.currentTimeMillis();
System.out.println("LinkedList插入耗时:" + (arrayInsertEnd2 - arrayInsertStart2) + "ms");
List<Integer> arrayFindList = new ArrayList<>();
List<Integer> linkedFindList = new LinkedList<>();
for (int i = 0; i < 100000; i++) {
arrayFindList.add(i);
linkedFindList.add(i);
}
System.out.println("-----------------------分割线----------------------------");
//ArrayList查询耗时
Long arrayInsertStart3 = System.currentTimeMillis();
for (int i = 0; i < 100000; i++) {
arrayFindList.get(5000);
}
Long arrayInsertEnd3 = System.currentTimeMillis();
System.out.println("ArrayList查询耗时:" + (arrayInsertEnd3 - arrayInsertStart3) + "ms");
//LinkedList查询耗时
Long arrayInsertStart4 = System.currentTimeMillis();
for (int i = 0; i < 100000; i++) {
linkedFindList.get(5000);
}
Long arrayInsertEnd4 = System.currentTimeMillis();
System.out.println("LinkedList查询耗时:" + (arrayInsertEnd4 - arrayInsertStart4) + "ms");
}
}
2.定义一个String类型的ArrayList集合,去除ArrayList中的重复元素
package Lx22.Day0707;
import java.util.ArrayList;
public class Homework3 {
public static void main(String[] args) {
ArrayList <String> arr = new ArrayList<>();
arr.add("a");
arr.add("s");
arr.add("d");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("s");
arr.add("f");
arr.add("f");
arr.add("g");
for (int i = 0; i < arr.size(); i++) {
for (int j = 0; j < arr.size() ; j++) {
if(arr.get(i).equals(arr.get(j)) && i!=j)
{
arr.remove(j);
j--;
}
}
}
System.out.println(arr);
}
}