dynamicstatisticstreetestdata.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 58 行

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//12 Mar 2008
package cn.edu.whu.iss.algorithm.unit14.test;

public interface DynamicStatisticsTreeTestData {
	Integer[][] NUMBERS = {
			{1,2,3,4,5,6,7,8,9},
			{9,8,7,6,5,4,3,2,1},
			{3,7,12,10,14,16,17,20,15,19,21,22,26,28,30,35,39,38,41,47},
			{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},
			{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}
	};
	Integer[][] StData_UNCHANGE = {
			{1,2,3,4,5,6,7,8,9},
			{1,2,3,4,5,6,7,8,9},
			{17},
			{2,3,4,5,6,7,8,9,10}
	};
	Integer[][] ANS_UNCHANGE = {
			{1,2,3,4,5,6,7,8,9},
			{1,2,3,4,5,6,7,8,9},
			{38},
			{2,3,4,5,6,7,8,9,10}
	};
	
	Integer[][] REMOVE_NUM = {
			{1,2,3,4,5,6},
			{0,2,3,4,5,6},
			{1},
			{2,3,4},
			{2,4,6,8,10,12,14,16}
	};
	Integer[][] StData_CHANGE = {
			{1,1,1,1,1,1},
			{1,1,1,1,1,1},
			{1},
			{3,4,5},
			{3,4,5,6,7,8,9,10}
			
	};
	Integer[][] ANS_CHANGE = {
			{2,3,4,5,6,7},
			{1,1,1,1,1,1},
			{3},
			{4,6,8},
			{4,6,8,10,12,14,16,18}
	};

}