• arraylist list 哈希表 字典表


    //ArrayList
    //ArrayList alt = new ArrayList();
    //alt.Add("123");
    //alt.Add(123);
    //alt.Add(true);
    //bool iscontain = alt.Contains("1");
    //alt.Clear();
    /*alt.Insert(0, "abc")*/;
    //Console.WriteLine(iscontain);

    //for(int i = 0; i < alt.Count; i++)
    //{
    // Console.WriteLine(alt[i].ToString() + " " + alt[i].GetType().ToString());
    //}

    //foreach (var x in alt)
    //{
    // Console.WriteLine(x.ToString() + " " + x.GetType().ToString());
    //}

    //泛型集合 List
    //List<string> str_list = new List<string>();
    //str_list.Add("a");
    //str_list.Add("b");
    //str_list.Add("c");
    //str_list.Add("d");

    //foreach(string x in str_list)
    //{
    // Console.WriteLine(x);
    //}


    //哈希表hashtable

    //Hashtable ht = new Hashtable();
    //ht.Add("1","a");
    //ht.Add(2, "b");
    //ht.Add(3, false);
    //ht.Add("x", 3.14);
    //Console.WriteLine(ht[2]);
    //foreach(var x in ht.Keys)
    //{
    // Console.WriteLine(ht[x]);
    //}

    //字典表 Dictionary

    //Dictionary<string, int> dic = new Dictionary<string, int>();
    //dic.Add("a", 3);
    //dic.Add("b", 4);
    //dic.Add("c", 5);
    //dic.Add("d", 6);
    //dic.Add("e", 7);

    //foreach(var x in dic.Keys)
    //{
    // Console.WriteLine(x);
    //}

    //队列 queue

    //Queue que = new Queue();
    //que.Enqueue("张三");
    //que.Enqueue("李四");
    //que.Enqueue("王五");
    //que.Enqueue("赵六");
    //Console.WriteLine("现在的长度是" + que.Count);
    //Console.WriteLine(que.Dequeue());
    //Console.WriteLine("现在的长度是" + que.Count);

    //堆栈 stack

    Stack st = new Stack();
    st.Push("a");
    st.Push("b");
    st.Push("c");
    st.Push("d");

    Console.WriteLine(st.Count);
    Console.WriteLine(st.Pop());
    Console.WriteLine(st.Count);

    Console.ReadLine();

  • 相关阅读:
    0401. Binary Watch (E)
    0436. Find Right Interval (M)
    0151. Reverse Words in a String (M)
    1344. Angle Between Hands of a Clock (M)
    0435. Non-overlapping Intervals (M)
    0434. Number of Segments in a String (E)
    0063. Unique Paths II (M)
    0062. Unique Paths (M)
    0100. Same Tree (E)
    0190. Reverse Bits (E)
  • 原文地址:https://www.cnblogs.com/niez1/p/6992040.html
Copyright © 2020-2023  润新知