String Sort

字符串排序

package string_comparator;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

public class ListSortTest
{

	public static void main(String[] args)
	{
		ArrayList<ArrayList<String>> aal = new ArrayList<ArrayList<String>>();

		ArrayList<String> al = new ArrayList<String>();
		al.add("zwf");
		al.add("27");
		aal.add(al);

		al = new ArrayList<String>();
		al.add("zwf");
		al.add("26");
		aal.add(al);

		al = new ArrayList<String>();
		al.add("zwb");
		al.add("25");
		aal.add(al);
		
		al = new ArrayList<String>();
		al.add("zwf");
		al.add("21");
		aal.add(al);

		al = new ArrayList<String>();
		al.add("zwb");
		al.add("19");
		aal.add(al);
		
		al = new ArrayList<String>();
		al.add("zwb");
		al.add("77");
		aal.add(2, al);
		
		for (int i = 0; i < aal.size(); i++)
		{
			System.out.println(aal.get(i).get(0) + "  " + aal.get(i).get(1));
		}
		
		System.out.println("");
		
		Collections.sort(aal, new Comparator<ArrayList<String>>()
		{
			public int compare(ArrayList<String> list_1, ArrayList<String> list_2)
			{
				String temp_1 = list_1.get(0) + list_1.get(1);
				String temp_2 = list_2.get(0) + list_2.get(1);
				int value = temp_1.compareTo(temp_2);
				if (value > 0)
				{
					return 1;
				}
				else if (value < 0)
				{
					return -1;
				}
				else
				{
					return 0;
				}				
			}
		});
		
		for (int i = 0; i < aal.size(); i++)
		{
			System.out.println(aal.get(i).get(0) + "  " + aal.get(i).get(1));
		}
	}

}

package string_comparator;

public class Obj implements Comparable<Obj>
{
	private String name;
	private String date;

	public Obj(String name, String date)
	{
		this.name = name;
		this.date = date;
	}

	public String getName()
	{
		return name;
	}

	public void setName(String name)
	{
		this.name = name;
	}

	public String getDate()
	{
		return date;
	}

	public void setDate(String date)
	{
		this.date = date;
	}

	public int compareTo(Obj o)
	{
		String temp_1 = o.getName() + o.getDate();
		String temp_2 = this.getName() + this.getDate();
		int value = temp_2.compareTo(temp_1);
		if (value > 0)
		{
			return 1;
		}
		else if (value < 0)
		{
			return -1;
		}
		else
		{
			return 0;
		}
	}
}

package string_comparator;

import java.util.ArrayList;
import java.util.Collections;

/**
 * 
 *
 * @author ZengWenFeng
 * @date 2021.10.30
 * @mobile 13805029595
 */
public class ObjSortTest
{
	public static void main(String[] args)
	{
		ArrayList<Obj> al = new ArrayList<Obj>();

		Obj o = new Obj("zwf", "2021.10.01");
		al.add(o);

		o = new Obj("zwf", "2021.10.11");
		al.add(o);

		o = new Obj("zwb", "2021.10.08");
		al.add(o);

		o = new Obj("zwf", "2021.07.08");
		al.add(o);

		for (int i = 0; i < al.size(); i++)
		{
			System.out.println(al.get(i).getName() + "  " + al.get(i).getDate());
		}

		System.out.println("-----");

		Collections.sort(al);

		for (int i = 0; i < al.size(); i++)
		{
			System.out.println(al.get(i).getName() + "  " + al.get(i).getDate());
		}
	}

	/*
	zwf  2021.10.01
	zwf  2021.10.11
	zwb  2021.10.08
	zwf  2021.07.08
	-----
	zwb  2021.10.08
	zwf  2021.07.08
	zwf  2021.10.01
	zwf  2021.10.11
	*/

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值