Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
custom Generic Que Implementation
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Rextester.Program.Main is the entry point for your code. Don't change it. //Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5 using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace Rextester { public class Program { public static void Main(string[] args) { //custom Generic Que Implementation Myqueue<String> que = new Myqueue<String>(); que.Enqueue("Rama"); que.Enqueue("Krishna"); que.Enqueue("Ram"); que.Enqueue("Krish"); que.printQueue(); que.Dequeue(); que.Dequeue(); que.printQueue(); } } public class Myqueue<T> { private int top; private List<T> list; public Myqueue() { top = -1; list = new List<T>(); } public void Enqueue(T item) { top++; list.Add(item); } public T Dequeue() { T obj = list[0]; list.Remove(obj); top--; return obj; } public T peek() { return list[top]; } public void printQueue() { Console.WriteLine("\n Stack elements"); foreach (T i in list) { Console.WriteLine(i); } } } }
Show compiler warnings
[
+
]
Show input
Compilation time: 0,12 sec, absolute running time: 0,11 sec, cpu time: 0,11 sec, average memory usage: 16 Mb, average nr of threads: 3, absolute service time: 0,27 sec
edit mode
|
history
|
discussion
Stack elements Rama Krishna Ram Krish Stack elements Ram Krish