Java Utililty Methods List Random Item

if (size < 0) {
    throw new IllegalArgumentException("Size cannot be less than 0. ");
if (strings == null || strings.length == 0) {
    throw new IllegalArgumentException("strings must contains at least one String. ");
List<String> list = new ArrayList<String>(size);
for (String string : strings) {
...

long start = System.currentTimeMillis();
List<String> randomList = new ArrayList<String>();
int r = 10000000;
for (int i = 1; i <= price; i++) {
    if (!oldRandomList.contains(String.valueOf(r + i))) {
        randomList.add(String.valueOf(r + i));
long mmmm = System.currentTimeMillis();
long secs = (mmmm - start) / 1000;
System.out.println(secs);
List<String> ranList = new ArrayList<String>();
for (int j = 0; j < size; j++) {
    if (randomList.size() > 0) {
        int ran = new Random().nextInt(randomList.size());
        ranList.add((String) randomList.get(ran));
        randomList.remove(ran);
return ranList.toString().replaceAll("\\s+", "").replace("[", "").replace("]", "");

if (list != null) {
    int n = list.size();
    if (n > 0x00) {
        return list.get(nextInt(n));
return null;

if (list.size() == 0) {
    throw new RuntimeException("list.size () must be > 0");
final int lowerBound = 0;
final int upperBound = list.size();
final int index = lowerBound + random.nextInt(upperBound - lowerBound);
return list.get(index);

if (vals.size() <= n) {
    return vals;
HashSet<T> elems = new HashSet<T>();
Random rand = new Random(seed);
for (int i = 0; i < n; i++) {
    boolean added = true;
    do {
...

return pickOneAtRandom(list, RANDOM);

return PickRandom(list.toArray());

if (n <= 0)
    throw new IllegalArgumentException("Parameter n must be > 0");
if (n > list.size())
    return list;
int l = list.size();
LinkedList<T> temp = list;
LinkedList<T> res = new LinkedList<T>();
Random r = new Random();
...

int index = rnd.nextInt(collection.size());
return collection.get(index);

return list[getRandomNumberBelow(list.length)];