1,2,5 - пункты проходит.
3,4,6 - пункты не проходят.
Как я понимаю, я не понимаю задания :(
package com.javarush.task.task08.task0811;
import java.util.*;
/*
Квартет «Методы»
*/
public class Solution {
public static List getListForGet() {
ArrayList<String> Array = new ArrayList<String>();
LinkedList<String> Linked = new LinkedList<String>();
for (int i = 0; i < 10000; i++) {
Array.add(i, "s");
Linked.add(i, "s");
}
Date BeforeCurrentArray = new Date();
Date BeforeCurrentLinked = new Date();
for (int i = 0; i < 10000; i++) {
Array.get(i);
Linked.get(i);
}
Date AfterCurrentArray = new Date();
Date AfterCurrentLinked = new Date();
if (AfterCurrentArray.getTime() - BeforeCurrentArray.getTime() < AfterCurrentLinked.getTime() - BeforeCurrentLinked.getTime())
return Array;
else
return Linked;
}
public static List getListForSet() {
ArrayList<String> Array = new ArrayList<String>();
LinkedList<String> Linked = new LinkedList<String>();
for (int i = 0; i < 10000; i++) {
Array.add(i, "s");
Linked.add(i, "s");
}
Date BeforeCurrentArray = new Date();
Date BeforeCurrentLinked = new Date();
for (int i = 0; i < 10000; i++) {
Array.set(i, "ss");
Linked.set(i, "ss");
}
Date AfterCurrentArray = new Date();
Date AfterCurrentLinked = new Date();
if (AfterCurrentArray.getTime() - BeforeCurrentArray.getTime() < AfterCurrentLinked.getTime() - BeforeCurrentLinked.getTime())
return Array;
else
return Linked;
}
public static List getListForAddOrInsert() {
Date BeforeCurrentArray = new Date();
Date BeforeCurrentLinked = new Date();
ArrayList<String> Array = new ArrayList<String>();
LinkedList<String> Linked = new LinkedList<String>();
for (int i = 0; i < 10000; i++) {
Array.add(i, "s");
Linked.add(i, "s");
}
Date AfterCurrentArray = new Date();
Date AfterCurrentLinked = new Date();
if (AfterCurrentArray.getTime() - BeforeCurrentArray.getTime() < AfterCurrentLinked.getTime() - BeforeCurrentLinked.getTime())
return Array;
else
return Linked;
}
public static List getListForRemove() {
ArrayList<String> Array = new ArrayList<String>();
LinkedList<String> Linked = new LinkedList<String>();
for (int i = 0; i < 10000; i++) {
Array.add(i, "s");
Linked.add(i, "s");
}
Date BeforeCurrentArray = new Date();
Date BeforeCurrentLinked = new Date();
for (int i = 0; i < 10000; i++) {
Array.remove(i);
Linked.remove(i);
}
Date AfterCurrentArray = new Date();
Date AfterCurrentLinked = new Date();
if (AfterCurrentArray.getTime() - BeforeCurrentArray.getTime() < AfterCurrentLinked.getTime() - BeforeCurrentLinked.getTime())
return Array;
else
return Linked;
}
public static void main(String[] args) {
}
}