策略模式 作业

JavaSE Lecture56

题目:



Person类

package com.master.sysu;

public class Person {
	private String name;
	private int age;
	private int id;

	public String getName() {
		return name;
	}

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

	public int getAge() {
		return age;
	}

	public void setAge(int age) {
		this.age = age;
	}

	public int getId() {
		return id;
	}

	public void setId(int id) {
		this.id = id;
	}

	public Person(String name, int age, int id) {
		this.age = age;
		this.id = id;
		this.name = name;
	}
}

策略一: 

按照ID 升序排ASC

package com.master.sysu;

import java.util.Comparator;

public class Strategy1 implements Comparator<Person> {

	@Override
	public int compare(Person o1, Person o2) {
		
		return o1.getId()-o2.getId();
	}
  
}

策略二:

按照Name 升序,如果name值一样,则按照ID的升序排

package com.master.sysu;

import java.util.Comparator;

public class strategy3sortByNameAsc implements Comparator<Person> {

	@Override
	public int compare(Person o1, Person o2) {
		if(o1.getName().equals(o2.getName()))
		{
			return o1.getId()-o2.getId();
		}
		else
			return o1.getName().compareTo(o2.getName());
	}
}

测试:

package com.master.sysu;

import java.util.Collections;

import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;

public class TestWork {

	public static void main(String[] args) {
		List<Person> list=new LinkedList<Person>();
		list.add(new Person("yan",24,13214007));
		list.add(new Person("zhang",22,13214009));
		list.add(new Person("zhoupengshan",23,13214010));
		list.add(new Person("yan",24,13211007));
		list.add(new Person("sunpin",23,13214001));
		
		list.add(new Person("huoziwei",24,13214052));
		list.add(new Person("linyibing",23,13214056));
	
		
		for(Iterator<Person> iter=list.iterator();iter.hasNext();)
		{
			Person per=iter.next();
			System.out.println("name="+per.getName()+" age="+per.getAge()+"number="+per.getId());
		}
		System.out.println("---------------------------------------------------------------");
		
		Comparator<Person> s1=new Strategy1();
		Collections.sort(list,s1);   //传入策略s1 
		
		for(Iterator<Person> iter=list.iterator();iter.hasNext();)
		{
			Person per=iter.next();
			System.out.println("name="+per.getName()+" age="+per.getAge()+"number="+per.getId());
		}
		
	System.out.println("---------------------------------------------------------------");
		
		Strategy2 s2=new Strategy2();
		Collections.sort(list,s2);   //传入策略s2 
		
		for(Iterator<Person> iter=list.iterator();iter.hasNext();)
		{
			Person per=iter.next();
			System.out.println("name="+per.getName()+" age="+per.getAge()+"number="+per.getId());
		}
		
System.out.println("---------------------------------------------------------------");
		
		strategy3sortByNameAsc s3=new strategy3sortByNameAsc();
		Collections.sort(list,s3);
		
		for(Iterator<Person> iter=list.iterator();iter.hasNext();)
		{
			Person per=iter.next();
			System.out.println("name="+per.getName()+" age="+per.getAge()+"number="+per.getId());
		}
		
System.out.println("---------------------------------------------------------------");
		
		Strategy4sortByAge s4=new Strategy4sortByAge();
		Collections.sort(list,s4);
		
		for(Iterator<Person> iter=list.iterator();iter.hasNext();)
		{
			Person per=iter.next();
			System.out.println("name="+per.getName()+" age="+per.getAge()+"number="+per.getId());
		}
			
	}
}

输出结果:


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值