Circulation problems;

轩无剑

as follows:
ArrayList al = new ArrayList ();
al.Add ("lei");
al.Add ("wanglei");
al.Add ("wanghao");
al.Add ("wanglei");
al.Add ("wanghao");

If I want to remove the duplicates inside, what should I do? Note that the number of values ​​in al is uncertain! ~

六零六

1.The removeDuplicate Method:
/ ** List order not maintained ** /
public static void removeDuplicate (ArrayList arlList)
{
   HashSet h = new HashSet (arlList);
   arlList.clear ();
   arlList.addAll (h);
}


2.The removeDuplicateWithOrder Method:
/ ** List order maintained ** /
public static void removeDuplicateWithOrder (ArrayList arlList)
{
   Set set = new HashSet ();
   List newList = new ArrayList ();
   for (Iterator iter = arlList.iterator (); iter.hasNext ();)
   {
      Object element = iter.next ()

dydcool

It seems that there is no way to judge ~~~

zz145304

ArrayList al2 = new ArrayList ();
for (int i = 0; i <al.Count; i ++)
{
  if (! al2.Contrains (al [i])
       al2.Add (al [i]);
}

al = al2;

shenmue024

ArrayList al = new ArrayList ();
al.Add ("lei");
al.Add ("wanglei");
al.Add ("wanghao");
al.Add ("wanglei");
al.Add ("wanghao");
al.Sort ();
for (int i = 1; i <al.Count; i ++)
{
if (al [i] .ToString () == al [i-1] .ToString ())
{
al.RemoveAt (i);
i--;
}
}

The

for (int i = 0; i <al.Count; i ++)
{
Response.Write (al [i] .ToString () + "<BR>");
}

苹果小刀

The method upstairs is good!