C# | Check if an element is in the Queue
Last Updated :
01 Feb, 2019
Queue represents a first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called enqueue, and when you remove an item, it is called deque. Queue.Contains(T) Method is used to check whether an element is in the Queue.
Properties:
- Enqueue adds an element to the end of the Queue.
- Dequeue removes the oldest element from the start of the Queue.
- Peek returns the oldest element that is at the start of the Queue but does not remove it from the Queue.
- The capacity of a Queue is the number of elements the Queue can hold.
- As elements are added to a Queue, the capacity is automatically increased as required by reallocating the internal array.
- Queue accepts null as a valid value for reference types and allows duplicate elements.
Syntax:
public virtual bool Contains(object obj);
Return Value: The function returns True if the element exists in the Queue and returns False if the element doesn’t exist in the Queue.
Below given are some examples to understand the implementation in a better way:
Example 1:
using System;
using System.Collections.Generic;
class GFG {
public static void Main()
{
Queue< int > myQueue = new Queue< int >();
myQueue.Enqueue(5);
myQueue.Enqueue(10);
myQueue.Enqueue(15);
myQueue.Enqueue(20);
myQueue.Enqueue(25);
Console.WriteLine(myQueue.Contains(7));
}
}
|
Example 2:
using System;
using System.Collections.Generic;
class GFG {
public static void Main()
{
Queue< string > myQueue = new Queue< string >();
myQueue.Enqueue( "Geeks" );
myQueue.Enqueue( "Geeks Classes" );
myQueue.Enqueue( "Noida" );
myQueue.Enqueue( "Data Structures" );
myQueue.Enqueue( "GeeksforGeeks" );
Console.WriteLine(myQueue.Contains( "GeeksforGeeks" ));
}
}
|
Reference:
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...