mapbound.java

构建网上购书最优联盟 此篇文章重在构建囊括最多变量因素的网上购书联盟。计算最优则变成了不断测试不断更改变量的统计型问题。而联盟要求的最低构建要素是： &#61548 联盟中心到站点的运输费

package tomato;



public class MapBound {
	
  private static int d_mapbound;
  private static MapBound _instance;
   
  private static MapBound Instance(){
     
     if (_instance == null)
	 _instance = new MapBound();
     return _instance;

  }
  protected MapBound(){}

  public static int GetBound(){
     
     return d_mapbound;
     	
  }
  
  public static void SetBound(int bound){
     
     d_mapbound = bound;
     
  }
  
  
  public static void main(String[]args){
  	
  	  int val;
	MapBound FirstMapBound = MapBound.Instance(); 
        MapBound SecondMapBound = MapBound.Instance();
	FirstMapBound.SetBound(40);
        System.out.println("Using first variable for MapBound, set d_mapbound to 40");		

	val = SecondMapBound.GetBound();
        System.out.println("Using second variable for MapBound, value retrieved = "+val);		
        
   	
  }
  
}