Advertisement
Advertisement
| 12.25.2007 at 07:41PM PST, ID: 23042708 |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: |
class CircularQueue
{
private int[] array;
private int head=0;
private int tail=0;
private int count=0;
private int arraySize=0;
CircularQueue() {
initialize();
}
public void enqueue(int val) throws Exception
{
synchronize {
if(count>=arraySize)
throw new Exception(" queue full");
q[tail]=val; // put the object to the
tail=(tail+1)%arraySize; // move the tail circulary
count++;
}
}
public int dequeue() throws Exception
{
synchronize {
if(count==0)
throw new Exception("queue empty");
int res=data[head]; // take the object from the head
head=(head+1)%arraySize; // move the head circulary
count--;
return res;
}
}
public void initialize() throws Exception
{
private static BufferedReader stdin =
new BufferedReader( new InputStreamReader( System.in ) );
System.out.print( "Please enter the size of the queue" );
String input = stdin.readLine();
arraySize = Integer.parseInt(input);
array = new int[arraySize] ;
}
}
|
