j.java

很好的3款手机游戏源码

		if (a_int_array1d_static[0] >= r.a_int_array1d_static[0] + r.b_int_array1d_static[0])
		{
			a_int_array1d_static[0] = r.a_int_array1d_static[0] + r.b_int_array1d_static[0];
			a_int_array1d_static[1] = r.a_int_array1d_static[1] + r.b_int_array1d_static[1];
			N = 1;
			r.b_int_static = 0;
			U = 0;
			V = 0;
			S = 0;
			b_boolean_static = false;
			b_u_static.a(0, a_int_array1d_static[0], a_int_array1d_static[1]);
		}
	}

	public static void p()
	{
		if (_DD9 != _B_B._BB[9])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			L = 1;
			break;

		case 6: // '\006'
		case 56: // '8'
			L = 2;
			break;

		case 2: // '\002'
		case 52: // '4'
			L = 3;
			break;

		case 5: // '\005'
		case 54: // '6'
			L = 4;
			break;
		}
	}

	public static void q()
	{
		if (_DD12 != _B_B._BB[12])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			L = 5;
			break;

		case 6: // '\006'
		case 56: // '8'
			L = 6;
			break;

		case 2: // '\002'
		case 52: // '4'
			L = 7;
			break;

		case 5: // '\005'
		case 54: // '6'
			L = 8;
			break;
		}
	}

	public static void r()
	{
		if (_DD13 != _B_B._BB[13])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			L = 1;
			break;

		case 6: // '\006'
		case 56: // '8'
			L = 2;
			break;

		case 2: // '\002'
		case 52: // '4'
			L = 3;
			break;

		case 5: // '\005'
		case 54: // '6'
			L = 4;
			break;
		}
	}

	public static void s()
	{
		if (_DD13 != _B_B._BB[13])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			L = 5;
			break;

		case 6: // '\006'
		case 56: // '8'
			L = 6;
			break;

		case 2: // '\002'
		case 52: // '4'
			L = 7;
			break;

		case 5: // '\005'
		case 54: // '6'
			L = 8;
			break;
		}
	}

	public static void t()
	{
		if (_DD11 != _B_B._BB[11])
			return;
		switch (N)
		{
		case 8: // '\b'
			S();
			break;

		case 9: // '\t'
			R();
			break;

		case 10: // '\n'
			T();
			break;

		case 12: // '\f'
			T();
			break;

		case 11: // '\013'
			U();
			break;

		case 13: // '\r'
			T();
			break;

		case 14: // '\016'
			Q();
			break;

		case 22: // '\026'
			P();
			break;

		case 23: // '\027'
			O();
			break;
		}
	}

	private static void O()
	{
		if (_DD8 != _B_B._BB[8])
			return;
		switch (n.i)
		{
		case 8: // '\b'
		case 53: // '5'
			N = 8;
			break;
		}
	}

	private static void P()
	{
		if (_DD8 != _B_B._BB[8])
			return;
		switch (n.i)
		{
		default:
			break;

		case 2: // '\002'
		case 52: // '4'
			if (ab == 2)
			{
				N = 2;
				if (n.a(0, 99) < J + K)
				{
					b_u_static.a(1, a_int_array1d_static[0], a_int_array1d_static[1]);
					r.b_int_static++;
					if (r.b_int_static > r.i)
						r.i = r.b_int_static;
					r.a_boolean_static = true;
				} else
				{
					Z = -1;
					b_u_static.a(2, a_int_array1d_static[0], a_int_array1d_static[1]);
				}
			}
			break;

		case 6: // '\006'
		case 56: // '8'
			if (ab != 20)
				break;
			N = 20;
			if (n.a(0, 99) < J)
			{
				b_u_static.a(3, a_int_array1d_static[0], a_int_array1d_static[1]);
				r.b_int_static++;
				if (r.b_int_static > r.i)
					r.i = r.b_int_static;
				r.a_boolean_static = true;
			} else
			{
				Z = -1;
				b_u_static.a(4, a_int_array1d_static[0], a_int_array1d_static[1]);
			}
			break;

		case 1: // '\001'
		case 50: // '2'
			if (ab != 21)
				break;
			N = 21;
			if (n.a(0, 99) < J)
			{
				b_u_static.a(5, a_int_array1d_static[0], a_int_array1d_static[1]);
				r.b_int_static++;
				if (r.b_int_static > r.i)
					r.i = r.b_int_static;
				r.a_boolean_static = true;
			} else
			{
				Z = -1;
				b_u_static.a(6, a_int_array1d_static[0], a_int_array1d_static[1]);
			}
			break;
		}
	}

	private static void Q()
	{
		if (_DD13 != _B_B._BB[13])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			c.v--;
			if (c.v < 0)
				c.v = 3;
			break;

		case 6: // '\006'
		case 56: // '8'
			c.v++;
			if (c.v > 3)
				c.v = 0;
			break;

		case 8: // '\b'
		case 53: // '5'
			N = 8;
			break;
		}
		switch (n.h)
		{
		case -7: 
			N = 8;
			break;
		}
	}

	private static void R()
	{
		if (_DD10 != _B_B._BB[10])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			X--;
			if (X < 0)
				X = 4;
			break;

		case 6: // '\006'
		case 56: // '8'
			X++;
			if (X > 4)
				X = 0;
			break;

		case 8: // '\b'
		case 53: // '5'
			if (X == 0)
			{
				if (l >= a_b_array1d_static[X].b)
					switch (a_b_array1d_static[X].a_int)
					{
					case 0: // '\0'
						N = 11;
						v();
						break;

					case 1: // '\001'
					case 3: // '\003'
						N = 12;
						u();
						break;

					case 2: // '\002'
					case 4: // '\004'
						R = -3;
						N = 12;
						break;
					}
			} else
			if (a_byte_static >= 3 + X * 2 && l >= a_b_array1d_static[X].b)
				switch (a_b_array1d_static[X].a_int)
				{
				case 0: // '\0'
					N = 11;
					v();
					break;

				case 1: // '\001'
				case 3: // '\003'
					N = 12;
					u();
					break;

				case 2: // '\002'
				case 4: // '\004'
					R = -3;
					N = 12;
					break;
				}
			break;
		}
		switch (n.h)
		{
		case -7: 
			N = 8;
			X = -1;
			break;
		}
	}

	private static void S()
	{
		if (_DD13 != _B_B._BB[13])
			return;
label0:
		switch (n.i)
		{
		default:
			break;

		case 1: // '\001'
		case 50: // '2'
			W--;
			if (W < 0)
				W = 4;
			break;

		case 6: // '\006'
		case 56: // '8'
			W++;
			if (W > 4)
				W = 0;
			break;

		case 8: // '\b'
		case 53: // '5'
			switch (W)
			{
			default:
				break;

			case 0: // '\0'
				N = 10;
				u();
				break label0;

			case 1: // '\001'
				N = 9;
				X = 0;
				break label0;

			case 2: // '\002'
				switch (n.a.h)
				{
				case 5: // '\005'
				case 15: // '\017'
				case 21: // '\025'
					break label0;
				}
				boolean flag = true;
				for (int i1 = 0; i1 < c.a_byte_array2d_static.length; i1++)
					if (c.a_byte_array2d_static[i1][0] == 0)
						flag = false;

				if (flag)
				{
					N = 23;
				} else
				{
					N = 13;
					u();
				}
				break label0;

			case 3: // '\003'
				N = 14;
				break label0;

			case 4: // '\004'
				switch (n.a.h)
				{
				default:
					N = 15;
					r.f = 7;
					break;

				case 5: // '\005'
				case 15: // '\017'
				case 21: // '\025'
					break;
				}
				break;
			}
			break;
		}
	}

	public static void u()
	{
		if (_DD13 != _B_B._BB[13])
			return;
		if (R != 0 && R != 1 && R != 2)
			R = 0;
		do
		{
			if (r.a_s_array1d_static[R].h > 0)
				break;
			R++;
			if (R > r.a_int_static - 1)
				R = 0;
		} while (true);
	}

	public static void v()
	{
		if (_DD9 != _B_B._BB[9])
		{
			return;
		} else
		{
			R = -2;
			return;
		}
	}

	private static void T()
	{
		if (_DD8 != _B_B._BB[8])
			return;
		if (R != -3)
			switch (n.i)
			{
			case 1: // '\001'
			case 50: // '2'
				do
				{
					R--;
					if (R < 0)
						R = r.a_int_static - 1;
				} while (r.a_s_array1d_static[R].h <= 0);
				break;

			case 6: // '\006'
			case 56: // '8'
				do
				{
					R++;
					if (R > r.a_int_static - 1)
						R = 0;
				} while (r.a_s_array1d_static[R].h <= 0);
				break;

			case 8: // '\b'
			case 53: // '5'
				switch (N)
				{
				case 10: // '\n'
					N = 16;
					break;

				case 12: // '\f'
					b_boolean_static = false;
					N = 3;
					U -= a_b_array1d_static[X].c;
					b_u_static.a(7, a_int_array1d_static[0], a_int_array1d_static[1]);
					break;

				case 13: // '\r'
					N = 18;
					b_u_static.a(7, a_int_array1d_static[0], a_int_array1d_static[1]);
					c_u_static.a(0, r.a_s_array1d_static[R].a_int_array1d[0], r.a_s_array1d_static[R].a_int_array1d[1]);
					int i1 = (100 - (r.a_s_array1d_static[R].h * 100) / r.a_s_array1d_static[R].f) + (a_byte_static - r.a_s_array1d_static[R].d) * 20;
					if (n.a(0, 99) < i1)
						r.a_s_array1d_static[R].v = 19;
					break;
				}
				break;
			}
		else
			switch (n.i)
			{
			case 8: // '\b'
			case 53: // '5'
				if (X == -1)
				{
					N = 16;
				} else
				{
					b_boolean_static = false;
					N = 3;
					U -= a_b_array1d_static[X].c;
					b_u_static.a(7, a_int_array1d_static[0], a_int_array1d_static[1]);
				}
				break;
			}
		switch (n.h)
		{
		default:
			break;

		case -7: 
			if (X == -1)
				N = 8;
			else
				N = 9;
			break;
		}
	}

	private static void U()
	{
		if (_DD8 != _B_B._BB[8])
			return;
		switch (n.i)
		{
		case 1: // '\001'
		case 50: // '2'
			if (R > -2)
				R--;
			break;

		case 6: // '\006'
		case 56: // '8'
			if (R < -1 && c.c > 0)
				R++;
			break;

		case 8: // '\b'
		case 53: // '5'
			b_boolean_static = false;
			N = 3;
			U -= a_b_array1d_static[X].c;
			b_u_static.a(7, a_int_array1d_static[0], a_int_array1d_static[1]);
			break;
		}
		switch (n.h)
		{
		case -7: 
			N = 9;
			break;
		}
	}

}