numberlist.java

来自「国外的数据结构与算法分析用书」· Java 代码 · 共 48 行

public class NumberList
{
	int[ ] number;
	int capacity;
	
	/**	Constructor for the class. */
	public NumberList(int size)
	{
		number = new int[size];
		capacity = size;
	}

	public void printDuplicates()
	{
		for (int i = 0; i < capacity; i++)
			for (int j = 0; j < capacity; j++)
				if (j != i && number[j] == number[i])
					System.out.println(number[i]);
	}

	public void fill(int r)
	{
		for (int i = 0; i < capacity; i++)
			number[i] = (i * 2 + 7) % r;
	}

	public boolean findNumber(int searchNumber)
	{
		boolean found = false;
		for (int i = 0; !found & (i < capacity); i++)
		{ 
			if (number[i] == searchNumber)
				found = true;
		}
		return found;
	}
	
	public void summarize (NumberList otherNumbers)
	{
		for (int i = 0; i < otherNumbers.capacity; i++)
		{
			int currentNumber = otherNumbers.number[i];
			if (findNumber(currentNumber))
				System.out.println(currentNumber);
		}
		printDuplicates();
	}
}