Collections.fill : Collections « Collections Data Structure « Java



import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;

class MainClass {
  public static void main(String[] args) {
    String[] coins = { "A", "B", "C", "D", "E" };

    List src = new LinkedList();
    for (int i = 0; i < coins.length; i++)

    List dst = new ArrayList();
    for (int i = 0; i < coins.length; i++)

    Collections.copy(dst, src);

    ListIterator liter = dst.listIterator();

    while (liter.hasNext())

    Collections.fill(src, "no coins");

    liter = src.listIterator();

    while (liter.hasNext())


Related examples in the same category

1.Collections.min with Comparator
2.Minimum and maximum number in array
3.Shuffling the Elements of a List or Array: use Collections.shuffle() to randomly reorder the elements in a list
4.Shuffle the elements in the array
5.Create an empty collection object
7.Use Collections.sort to sort custom class and user defined Comparator
8.Collections.shuffle to shuffle a list
9.Demonstrates the use of final collections
10.Use Collections.shuffle to shuffle listUse Collections.shuffle to shuffle list
11.Making a Collection Read-Only
12.Shuffle generic list
13.Create List containing n Copies of Specified Object Example
14.Create and demonstrate an immutable collection.
15.Sort and Search a LinkedList.
16.Finding an Element in a Sorted List
17.Use reverse(), rotate(), and shuffle().
18.This program demonstrates the random shuffle and sort algorithmsThis program demonstrates the random shuffle and sort algorithms