C # brief introduction to stack set

1. Using system;
2. Using system. Collections. Generic;
3. Using system. LINQ;
4. Using system. text;
6. Namespace set
7. {
8. Class Stack
9. {
10. Public static void main ()
11. {
12. // The stack and queue are very similar containers.
13. // The difference is that the queue is FIFO, while the stack is lifo.
14. // Stack and stack <>. Like a queue, stacks also provide generic and non-generic versions.
15. // The stack method is basically the same as that of the queue
16. // POP () reads the stack from the top of the stack and deletes the element push () to store data. The top of the stack PEEK () reads the data from the top of the stack but does not delete the data.
18. // Write an example below to use the stack
19. Stack <string> stack = new stack <string> ();
21. Stack. Push ("");
22. Stack. Push ("B ");
23. Stack. Push ("C ");
25. Foreach (string s in stack)
26. {
27. Console. writeline (s );
28. }
29. // The result is CBA because the stack is backward-in-first-out.
31. // If we use the enumerator above, the elements will not be changed and cannot be deleted. Now we use Pop to read the output.
32. Console. writeline ("Use Pop to read -------------------------");
34. While (stack. Count! = 0)
35. {
36. Console. writeline (stack. Pop ());
37. }
39. Console. writeline ("stack size after pop: {0}", stack. Count );
41. Console. Readline ();
43. }
44. }
45. }