内容显示页
 
类别:.Net + C# | 浏览(27) | 2008-4-18 11:57:25

public static String[] RemoveDup(String[] myData)
{
    if (myData.Length > 0)
    {
        Array.Sort(myData);
        int size = 1; 
        for (int i = 1; i < myData.Length; i++)
            if (myData[i] != myData[i - 1])
                size++;
        String[] myTempData = new String[size];
        int j = 0;
        myTempData[j++] = myData[0];
        for (int i = 1; i < myData.Length; i++)
            if (myData[i] != myData[i - 1])
                myTempData[j++] = myData[i];
        return myTempData;
    }
    return myData;
}
//演示

using System;
using System.Collections.Generic;
using System.Text;

namespace 排除重复行
{
    class Program
    {
        static void Main(string[] args)
        {
            String[] a ={ "1", "1", "2", "1", "1", "3", "1", "1", };
            Console.WriteLine("原数组长度:    {0}", a.Length);
            Console.WriteLine("排除后数组长度:{0}",RemoveDup(a).Length);
            Console.ReadKey();
        }
        public static String[] RemoveDup(String[] myData)
        {
            if (myData.Length > 0)
            {
                Array.Sort(myData);

                int size = 1; //at least 1 
                for (int i = 1; i < myData.Length; i++)
                    if (myData[i] != myData[i - 1])
                        size++;

                String[] myTempData = new String[size];

                int j = 0;

                myTempData[j++] = myData[0];

                for (int i = 1; i < myData.Length; i++)
                    if (myData[i] != myData[i - 1])
                        myTempData[j++] = myData[i];

                return myTempData;
            }

            return myData;
        }
    }
}

 


引用本页地址:http://www.yongfa365.com/item/CRuHeXiaoChuZiFuChuanShuZuDeZhongFuXiangDeHanShu.html
 
 
相关链接
 
网友评论:
姓名: 记住我
网址:
邮箱:
内容:
验证码:  验证码图片看不清? 换张图试试
 
   
 
 
文章分类
 
 
专题(3)
 
ASP+VBS(141)
 
 
 
 
Linux(10)
 
 
SQL(55)
 
web 2.0(22)
 
 
 
 
 
 
心程(48)
 
生活(71)
 
创业(5)
 
   

power by :柳永法(yongfa365)'Blog | model by :hibaidu | css by:众网友 | 京ICP备07011491号   我要统计  

本空间赞助商:北京中科兴联信息技术有限公司

QQ:64049027    E-mail:64049027<at>qq.com