1  public static char[] sort(char[] P,ref int m)
 2         {
 3
 4             for (int j = 0; j < P.Length - 1; j++)
 5             {
 6                 for (int i = 0; i < P.Length - 1 - j; i++)
 7                 {
 8                     if (P[i] > P[i + 1])
 9                     {
10                         char point1 = P[i];
11                         P[i] = P[i + 1];
12                         P[i + 1] = point1;
13                     }
14                 }
15             }
16             char x = P[1];
17             int k = 2;
18             for (int i = 2; i < P.Length; i++)
19             {
20                 if (P[i] != x)
21                 {
22                     P[k] = P[i];
23                     x = P[i];
24                     k++;
25                 }
26             }
27             m = k;
28             return P;
29         }

 1 public static int LongestAddSubsequence(string A)
 2         {
 3             int longest = 1;
 4             int[] dp = new int[A.Length];
 5             for (int i = 0; i < A.Length; i++)
 6                 dp[i] = 1;//初始话均为1
 7             for (int i = 1; i < A.Length; i++)
 8                 for (int j = i - 1; j >= 0; j--)
 9                     if (A[i] > A[j] && dp[i] < dp[j] + 1)//遇到比当前值小，并且长度比当前长度大的就更新当前长度
10                         dp[i] = dp[j] + 1;
11             for (int i = 0; i < A.Length; i++)
12                 if (dp[i] > longest)
13                     longest = dp[i];
14                 return longest;
15         }