|
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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 |
using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace FixedStack { class Program { static void Main(string[] args) { // fill stack with Count elements int Count = 10; //FixedCapacityStackOfStrings s = new FixedCapacityStackOfStrings(Count); FixedGenericsStack<string> s = new FixedGenericsStack<string>(Count); Random r = new Random(); Console.WriteLine("lets fill stack with Count elements"); for (int i = 0; i < Count; i++) { int someRandomNumber = r.Next(100); s.push(someRandomNumber.ToString()); Console.WriteLine(someRandomNumber); } Console.WriteLine("What size of stack now?"); Console.WriteLine(s.size()); Console.WriteLine("lets take last 5 elements from stack"); for (int i = 0; i < 5; i++) { Console.WriteLine(s.pop()); } Console.WriteLine("What size of stack now?"); Console.WriteLine(s.size()); Console.WriteLine("If stack isEmpty?"); if (s.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No"); Console.ReadLine(); } } class FixedCapacityStackOfStrings { private string[] a; public int N; public FixedCapacityStackOfStrings(int ACapacity) { a = new string[ACapacity]; } public bool isEmpty() { return N == 0; } public int size() { return N; } public void push(string item) { a[N++] = item; } public string pop() { return a[--N]; } } class FixedGenericsStack<T> { private T[] a; public int N; public FixedGenericsStack(int ACapacity) { a = new T[ACapacity]; } public bool isEmpty() { return N == 0; } public int size() { return N; } public void push(T item) { a[N++] = item; } public T pop() { return a[--N]; } } } |