对集合进行排序

对集合进行排序

排序1


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
 
 
 
public class Test {
     
    public Test(){
        Object[] new1 = {"1","a","c"};
        Object[] new2 = {"8","a","c"};
        Object[] new3 = {"7","a","c"};
        Object[] new4 = {"9","a","c"};
        Object[] new5 = {"4","a","c"};
        Object[] new6 = {"5","a","c"};
        Object[] new7 = {"3","a","c"};
        List list = new ArrayList();
        list.add(new1);
        list.add(new2);
        list.add(new3);
        list.add(new4);
        list.add(new5);
        list.add(new6);
        list.add(new7);
        Collections.sort(list, new MyComparator());
        for(Object o:list){
            Object[] obs = (Object[])o ;
            System.out.println("["+obs[0]+","+obs[1]+","+obs[2]+"]");
        }
    }
     
     
    private class MyComparator implements Comparator{
 
        public int compare(Object o1, Object o2) {
            Object[] obs1 = (Object[])o1;
            Object[] obs2 = (Object[])o2;
            String str1 = obs1[0].toString();
            String str2 = obs2[0].toString();
            return str1.compareTo(str2);
        }
         
    }
     
     
    public static void main(String[] args) {
        new Test();
    }
}

排序2


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import java.util.ArrayList;
import java.util.List;
 
 
public class Main {
 
    /**
     * @param args
     */
    public static void main(String[] args) {
 
        Object[] new1 = {"1","a","c"};
        Object[] new2 = {"8","a","c"};
        Object[] new3 = {"7","a","c"};
        Object[] new4 = {"9","a","c"};
        Object[] new5 = {"4","a","c"};
        Object[] new6 = {"5","a","c"};
        Object[] new7 = {"3","a","c"};
        List list = new ArrayList();
        list.add(new1);
        list.add(new2);
        list.add(new3);
        list.add(new4);
        list.add(new5);
        list.add(new6);
        list.add(new7);
         
        for(int i=0;i<list.size();i++)
        {
            Object[] obj = (Object[]) list.get(i);
            int id = Integer.parseInt(obj[0].toString());
            for(int j=i;j<list.size();j++)
            {
                Object[] obj2 = (Object[]) list.get(j);
                int id2 = Integer.parseInt(obj2[0].toString());
                if(id>id2)
                {
                    list.remove(i);
                    id = Integer.parseInt( ((Object[]) list.get(i))[0].toString());
                    j=i;
                    list.add(obj);
                    obj = (Object[]) list.get(i);
                }
            }
        }
         
        for(int i=0;i<list.size();i++)
        {
            Object[] obj = (Object[]) list.get(i);
            System.out.println(obj[0]);
        }
    }
 
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值