C的#经典入门教程详解.ppt

Console.WriteLine(poem1 == poem2); Console.WriteLine(poem1 == poem3); Console.WriteLine(ReferenceEquals(poem1, poem3)); Console.WriteLine(ReferenceEquals(poem1, poem2)); Console.WriteLine(ReferenceEquals(poem1, Kubla Khan)); 比较字符串 String.Compare int Compare(string str1, string str2); int Compare(string str1, string str2, bool IgnoreCase); int Compare(string str1, string str2, bool IgnoreCase, CultureInfo ci); int Compare(string str1, int index1, string str2, int index2, int len); str1==str2，返回0； str1str2，返回0； str1str2，返回0. string s1 = circle; string s2 = chair; int result = String.Compare(s1, s2, true, new CultureInfo(cs-CZ)); //-1 比较字符串 String.CompareOrdinal: Unicode码值为判断大小标准 string s1 = AUTUMN; string s2 = autumn; int result = String.Compare(s1, s2); //1 result = String.CompareOrdinal(s1, s2); //-32 搜索字符串 [n] string poem = “Kubla Khan”; poem[0]; IndexOf, LastIndexOf(string, [int start], [int count]) int n=poem.IndexOf(“la”); n=poem.IndexOf(‘K’,4); IndexOfAny, LastIndexOf char[] chs = {‘a’, ‘e’, ‘i’, ‘o’, ‘u’}; N=poem.IndexOfAny(chs); N=poem.LastIndexOfAny(chs,2); 如果没找到，返回-1 字符串修改 Insert(int, string) string str = and he stoppeth three; string verse = str.Insert(str.IndexOf( three), one of); PadRight, PadLeft string rem = and so on; rem = rem.PadRight(rem.Length + 3, .); Remove(P, n) Replace(A, B) string str = “nap ace sap path; string verse = str.Replace(‘a’, ‘i’); verse = str.Replace(“a”, “i”); Split(char []) string str = “red, blue orange; string[] split= str.Split(new char[] {‘ ’, ‘,’}); split[2]=? ToUpper() ToLower() Trim(), Trim(char []) string str = “ some; str=str.Trim(); str=str.Trim(‘ ’, ‘s’); TrimEnd(char []), TrimStart(char []) string str = “ some; str=str.TrimEnd(‘e’); SubString(n), SubString(n, l) ToCharArray(), ToCharArray(n,l) string str = “some; char[] chs = str.ToCharArray(); StringBuilder类 字符串的主要缺点是：每次字符串变量的内容发生改变时，都必须重新分配内存。假设创建一个迭代100次的循环，每次迭代将一个字符连接到字符串，内存中将有100个字符串。 StringBuilder类通过分配一个工作区(缓存)解决这个问题。 using System.Text; StringBuilder