蓝桥杯2016javaA组_搭积木问题

public class text7 {

	/**
	 * 搭积木 蓝桥杯2016javaA组 作者：mike
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		text7 text = new text7();
		int[] xiangzi = new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
		int[] jinzita = new int[10];

		text.Do(0, xiangzi, jinzita, count);
		System.out.println(text.getCount());
	}

	private static int count = 0;//要保存count值的做法之一是把他变为全局变量

	public static int getCount() {
		return count;
	}

	public void Do(int N, int[] xiangzi, int[] jinzita, int count) {
		for (int n = 0; n < xiangzi.length; n++) {
			if (xiangzi[n] == -1)
				continue;
			if (N == 1 || N == 2) {
				if (xiangzi[n] < jinzita[0])
					continue;
			}

			if (N == 3 || N == 4) {
				if (xiangzi[n] < jinzita[1])
					continue;
			}

			if (N == 4 || N == 5) {
				if (xiangzi[n] < jinzita[2])
					continue;
			}

			if (N == 6 || N == 7