stack 棧
int [] numbers={1,2,3,4,5};
string[] strs = { "li", "liu", "zhang", "wang" };
Stack stack=new Stack(strs);
//入棧 Push
stack.Push(1);
//出棧 Pop
int number = (int)stack.Pop(); // 此時移除 wang
object obj = stack.Pop ();
Console.WriteLine (obj);
//獲取棧頂元素 Peek
object obj_1=stack.Pop(); //此時移除 zhang
Console.WriteLine (obj_1);
object obj_2=stack.Peek(); // 輸出為liu
Console.WriteLine (obj_2);
//是否包含某個元素
stack.Contains("2");
//轉(zhuǎn)為數(shù)組
object[] objs=stack.ToArray();
//獲取棧的長度
int count=stack.Count;
//輸出棧中的每個元素
for(int i=0;i<count;++i){
Console.WriteLine( stack.Pop ());
}
隊列
Queue queue=new Queue(stack); //可以把棧轉(zhuǎn)成隊列
Queue <int>queue_2=new Queue<int>(numbers);
//入隊列 從后面入
queue.Enqueue("li");
queue_2.Enqueue (1);
//出隊列
object obj= queue.Dequeue();
int number = queue_2.Dequeue ();
//獲取隊列的頭部元素
object obj_1=queue.Peek();
int number_1 = queue_2.Peek ();
Console.WriteLine (obj_1);
//隊列元素個數(shù)
queue_2.Count;
queue.Count;
Console.WriteLine (queue.Count);
字典
Dictionary<string,int>dic=new Dictionary<string, int>();
dic.Add ("One", 1);
dic.Add ("Two", 2);
int number = dic ["One"];
//修改
dic ["One"]=3;
int number1 = dic ["One"];
Console.WriteLine (number1);
Dictionary<string,string>strDic=new Dictionary<string, string>();
//若是沒有 會自動加 鍵是獨一無二的 值是可以重復(fù)的.
strDic ["Li"] = "an";
strDic ["Li"] = null;
//值就變?yōu)镹ull了
Console.WriteLine (strDic["Li"]);
strDic.Remove ("Li");
//打印字典長度 (鍵和值 一起)單位是 對;
Console.WriteLine (strDic.Count);
//是否包含指定的鍵
if (dic.ContainsKey ("Three")) {
Console.WriteLine ("XXXXX");
}
//是否包含指定的值
if (dic.ContainsValue (2)) {
Console.WriteLine ("Value is 2");
}
//keys 表示字典里對應(yīng)的鍵
foreach (string key in dic.Keys) {
Console.WriteLine (key+" : "+dic[key]);
}
foreach (int value in dic.Values) {
Console.WriteLine (value);
}