C#結(jié)構(gòu)體排序

1................................................. 聲明 struct data { public string A; public string B; } 創(chuàng)建測試數(shù)據(jù) data[] st = new data[4] { new data() { A = "CC", B = "003" }, new data() { A = "BB", B = "002" }, new data() { A = "DD", B = "005" }, new data() { A = "AA", B = "007" } }; 按照 data.B 順序排列 data[] basc = st.OrderBy(P => P.B).ToArray<data>(); 按照 data.B 倒序排列 data[] bdesc= st.OrderByDescending(P => P.B).ToArray<data>();2..........................................................struct data:IComparable<data>{ string A;string B;public int CompareTo(data d){return this.B.CompareTo(d.B);}}
隊(duì)列

DirectoryInfo tou = null, xin = null;//文件類型 xin = (DirectoryInfo)s;//把參數(shù)s強(qiáng)制轉(zhuǎn)換 Queue<DirectoryInfo> q = new Queue<DirectoryInfo>(); q.Enqueue(xin);//進(jìn)隊(duì)列 while (q.Count() != 0)//判斷是否為空 tou = q.First();//取出 q.Dequeue();//刪除 容器

static Dictionary<string, int> mark = new Dictionary<string, int>(); mark[myProcess.ProcessName] = 1; 賦值 mark.Remove();刪除 mark.ContainsKey()查是否存在

總結(jié)

以上是生活随笔為你收集整理的C#-几个STL相关的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。