单例模式(Singleton Pattern)

情景:只有一个皇帝(Emperor),三个臣子(Minister)向一个皇帝汇报。

public class Emperor 
{
private static final Emperor emperor = new Emperor();

private Emperor()
{

}

public static Emperor getInstance()
{
return emperor;
}

public static void say()
{
System.out.println("我是皇帝A");
}
}
public class Minister 
{

public static void main(String[] args)
{
for(int n=0; n<3; n++)
{
Emperor emperor = Emperor.getInstance();
emperor.say();
}
}
}

 

扩展情况:

有三个皇帝,大臣可以像其中一个皇帝汇报

import java.util.ArrayList;
import java.util.Random;


public class Emperor
{
private static int maxNumOfEmperor = 2;
private static ArrayList<String> nameList = new ArrayList<String>();
private static ArrayList<Emperor> emperorList = new ArrayList<Emperor>();

private static int countNumOfEmperor = 0;

static
{
for(int n=0; n<maxNumOfEmperor; n++)
{
emperorList.add(new Emperor("皇" + (n + 1)));
}
}

private Emperor()
{

}

private Emperor(String name)
{
nameList.add(name);
}

public static Emperor getInstance()
{
Random random = new Random();

countNumOfEmperor = random.nextInt(maxNumOfEmperor);

return emperorList.get(countNumOfEmperor);
}

public static void say()
{
System.out.println(nameList.get(countNumOfEmperor));
}
}
public class Minister 
{

public static void main(String[] args)
{
int ministerNum = 5;

for(int n=0; n<ministerNum; n++)
{
Emperor emperor = Emperor.getInstance();

emperor.say();
}
}

}





转载于:https://www.cnblogs.com/xiaobo68688/archive/2012/02/24/2367164.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值