// Remove an element from the front of the queue which is index // 0. Shift all
ID: 3664630 • Letter: #
Question
// Remove an element from the front of the queue which is index
// 0. Shift all existing elements to the left by one index. The new
// front of the queue should be at index 0 after this shift. Ensure
// that all empty slots have the value -1 in them. On successfully
// removing an element, return true. If queue is empty (length 0 or
// all elements are -1), return false.
//
// EXAMPLES:
// int [] q = {-1, -1, -1};
// boolean result = removeFromFrontOfQueue(q);
// q is now {-1, -1, -1}
// result is false
//
// int [] q = {4, 2, -1};
// boolean result = removeFromFrontOfQueue(q);
// q is now {2, -1, -1}
// result is true
//
// int [] q = {2, -1, -1};
// boolean result = removeFromFrontOfQueue(q);
// q is now {-1, -1, -1}
// result is true
//
// int [] q = {2, 1, 9, 7, -1};
// boolean result = removeFromFrontOfQueue(q);
// q is now {1, 9, 7, -1, -1}
// result is true
//
// int [] q = {};
// boolean result = addToEndOfQueue(q);
// q is now {}
// result is false
public static boolean removeFromFrontOfQueue(int [] queue){
Explanation / Answer
here i am considerin the remove request sending to function removeFromFrontOfQueue(int [] queue) only once to remove first element only , that means when ever you wants to remove first element of arry request and returns true after removing and again you have to call the function if you need to remove again from front of queue.
also considering last element of queue always may or may not be -1;
public static boolean removeFromFrontOfQueue(int [] queue){
int length=queue.length;
if((length==0) || (length==1)&&queue[0]==-1))
return false;
}
else{
if(length==1){
queue[0]==-1;
return true;
}
else{
for(int i=0; i<length;i++){
if(queue[i]==-1&& i!=--length){
continue;
}else{
return false;
}
}
for(int i=0;i<(length-1);i++){
queue[i] = queue[++i];
}
queue[length]==-1;
return true;
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.