从阵列中删除重复项

本文关键字:删除 阵列 | 更新日期: 2023-09-27 18:15:24

我有一个加载文本文件并将其保存为数组的代码。该数组包含一个数字列表,其中一些数字是重复的。在我的代码中,我首先循环遍历数组并用-1替换所有重复的数字。然后我打算从数组中删除所有的-1值。然后将剩余的数组值(非重复项)复制到要输出的新数组中。

然而,当我试图从数组中删除-1值时,我一直得到一个错误(参见下面的代码)。我不知道为什么会发生这种情况,所以如果有人知道任何事情,请让我知道!

注:这是学校的项目,所以我只能使用循环和if语句,不能使用LINQ或foreach等。

public partial class Form1 : Form
{
    //Global Variable
    int[] Original;
    public Form1()
    {
        InitializeComponent();
    }
    //Exit Application
    private void mnuExit_Click_1(object sender, EventArgs e)
    {
        this.Close();
    }
    //Load File
    private void mnuLoad_Click_1(object sender, EventArgs e)
    {
        //Code to Load the Numbers From a File
        OpenFileDialog fd = new OpenFileDialog();
        //Open the File Dialog and Check If A File Was Selected
        if (fd.ShowDialog() == DialogResult.OK)
        {
            //Open File to Read
            StreamReader sr = new StreamReader(fd.OpenFile());
            int Records = int.Parse(sr.ReadLine());
            //Assign Array Sizes
            Original = new int[Records];
            //Go Through Text File              
            for (int i = 0; i < Records; i++)
            {
                Original[i] = int.Parse(sr.ReadLine());
            }
        }
    }
    private void btnOutput_Click(object sender, EventArgs e)
    {
        //Store Original Array
        string Output = "Original 'n";
        //Output Original Array
        for (int i = 0; i < Original.Length; i++)
        {
            Output = Output + Original[i] + "'n";
        }
        //Create TempArray
        int[] TempArray = new int[Original.Length];
        //Set TempArray Equal to Original Array
        for (int i = 0; i < Original.Length; i++)
        {
            TempArray[i] = Original[i];
        }
        //Duplicate Number Counter
        int Counter = 0;
        //Loop Through Entire Array
        for (int i = 0; i < TempArray.Length; i++)
        {
            for (int j = i + 1; j < TempArray.Length; j++)
            {
                //Replace Duplicate Values With '-1'
                if (TempArray[i] == TempArray[j])
                {
                    TempArray[j] = -1;
                    Counter++;
                }
            }
        }
        //Set Size of Original Array
        Original = new int[Original.Length - Counter];
        //Remove -1 Values
        //Index Counter
        int Index = 0;
//error starts
        for (int i = 0; i < TempArray.Length; i++)
        {
            if (TempArray[i] != -1)
            {
                 Original[Index] = TempArray[i];
                Index++;
            }
        }
//error ends
        //Final Output -- The New Array
        Output = Output + "Original Without Duplicates'n";
        for (int i = 0; i < Original.Length; i++)
        {
            Output = Output + Original[i] + "'n";
        }
        lblOutput.Text = Output;
        }
    }
}

从阵列中删除重复项

TempArray[i] = Original[Index];换行为Original[Index] = TempArray[i];

在这种情况下您唯一需要做的就是

Original = new int[Original.Length - (Counter-1)];

,是的,你需要改变代码,将值分配给Original而不是TempArray。

//error starts
for (int i = 0; i < TempArray.Length; i++)
{
    if (TempArray[i] != -1)
    {
        Original[Index] = TempArray[i];
        Index++;
    }
}
//error ends

假设你的数组中有三个3。在外部循环中,当您迭代并遇到3时,将其他两个3设置为-1。现在你遇到了第一个-1,它之前是一个3,你已经把最后一个3设置为-1。现在你在重复数计数器(称为Counter)中搜索重复并错误地计算重复数,因为对你来说-1-1的副本。

那么,你可以这样做:

首先只将所有重复项设置为-1,然后通过再次循环数组来计算-1的数量。这样你就可以正确地设置非重复数组元素的大小。

设置所有设置为-1:

for (int outerIndex = 0; outerIndex < Original.Length; outerIndex++)
{
    var currentElement = Original[outerIndex];
    for (int innerIndex = outerIndex + 1; innerIndex < Original.Length; innerIndex++)
    {
        if (Original[innerIndex] == currentElement) Original[innerIndex] = -1;
    }
}

获取非重复元素的计数:

var counter = 0;
for (int index = 0; index < Original.Length; index++)
{
    if (Original[index] != -1) counter++;
}

创建非重复元素数组:

var newArrayIndex = 0;
var newArray = new int[Original.Length - counter]; //Calculated counter above
for(int i = 0; i < Original.Length; i++)
{
    if (Original[i] != -1) newArray[newArrayIndex++] = Original[i];
}
//Finally, not good programming practice, but 
//you can set Original to this newArray if you like...
Original = newArray;