计算符匹配

//填写运算符问题 ：5 5 5 5 5=5 在其中插入 + - * / 运算符使等式成立
public class test {

	// 运算字符中是否只有加减法
	static boolean justdoit = false;
	static int sum = 5;

	public static void main(String args[]) {
		test t = new test();
		int number[] = { 5, 5, 5, 5, 5 };
		int sign[] = new int[] { 1, 2, 3, 4 };// + - * /
		char signs[] = new char[] { '+', '-', '*', '/' };
	

		for (int i = 1; i < sign.length+1; i++) {
			for (int j = 1; j < sign.length+1; j++) {
				for (int n = 1; n < sign.length+1; n++) {
					for (int k = 1; k < sign.length+1; k++) {
						int s[] = { i, j, n, k };
						if (t.success(s, number)) {
							System.out.println("等式成立结果：");
							System.out.println(signs[i-1] + " " + signs[j-1] + " "
									+ signs[n-1] + " " + signs[k-1]);

						}
					}
				}
			}
		}


	}

	// 计算运算等式是否成功
	public boolean success(int[] s1, int[] number) {
		int Cnum = s1.length;// 运算字符数
		int Nnum = number.length;// 计算字符数
		int num[] = number.clone();
		int s[]=s1.clone();

		for (int n = 0; n < Cnum; n++) {
			if (s[n] > 2) {
				// 如果是为除法的话
				if (s[n] == 4) {
					// 如果除数为零
					if (num[n + 1] == 0) {
						return false;
					}				
					num[n] /= num[n + 1];
				}
				if (s[n] == 3) {
					// 乘法
					num[n] *= num[n + 1];
				}
				Nnum--;
				Cnum--;
				// 计算数减少一位
				for (int i = n + 1; i < Nnum; i++) {
					num[i] = num[i + 1];
				}
				// 字符位减少
				for (int j = n; j < Cnum; j++) {
					s[j] = s[j + 1];
				}
				n--;
			}
		}
		int left = num[0];
		for (int i = 0; i < Cnum; i++) {
			if (s[i] == 1) {
				left += num[i + 1];
			} else {
				left -= num[i + 1];
			}
		}
		if (left == sum) {
			return true;
		}

		return false;
	}
}