p.java

很好的3款手机游戏源码

				h = vector;
				e();
			}
			break;

		case -6: 
		case -5: 
		case 53: // '5'
			if (d != null)
			{
				c c11 = ((ap)(ap)d).j;
				int k1 = ((ap)(ap)d).h[bP];
				Vector vector1 = c11.a(k1);
				l(d);
				l();
				h = vector1;
				e();
			}
			break;
		}
		a(i1);
	}

	void w(int i1)
	{
		switch (i1)
		{
		case -7: 
			cF = 105;
			break;
		}
	}

	void t(int i1)
	{
		if (!ad())
			return;
		switch (i1)
		{
		default:
			break;

		case -7: 
			p  = this;
			ac = c5;
			if (ae.else)
			{
				ae.else = false;
				bn = false;
				cI.char = 1;
				cI.a = 82;
			}
			break;

		case -6: 
		case -5: 
		case 53: // '5'
			ac = c5;
			bn = true;
			if (ae.int)
			{
				ae.int(this);
				return;
			}
			if (ae.else)
			{
				ae.do(this);
				return;
			}
			switch (c5)
			{
			case 84: // 'T'
				ae.a(i1, this);
				a(0);
				break;

			case 71: // 'G'
				a3.do(i1);
				break;

			case 72: // 'H'
				au.a(i1);
				break;

			case 74: // 'J'
			case 75: // 'K'
			case 76: // 'L'
				aR.do(i1);
				break;
			}
			break;
		}
	}

	void int(int i1)
	{
		switch (ac)
		{
		case 84: // 'T'
			ae.a(i1, this);
			a(i1);
			break;

		case 80: // 'P'
			x.z(i1);
			a(i1);
			break;

		case 8: // '\b'
			t(i1);
			a(i1);
			break;

		case 72: // 'H'
			au.a(i1);
			a(i1);
			break;

		case 71: // 'G'
			a3.do(i1);
			a(i1);
			break;

		case 16: // '\020'
			w(i1);
			break;

		case 12: // '\f'
			try(i1);
			a(i1);
			break;

		case 2: // '\002'
			p(i1);
			break;

		case 3: // '\003'
			else(i1);
			a(i1);
			break;

		case 74: // 'J'
		case 75: // 'K'
		case 76: // 'L'
			aR.do(i1);
			a(i1);
			break;
		}
	}

	void else(int i1)
	{
		if (a7 < 5)
		{
			a7 = 5;
			return;
		}
		String s1 = I[cA];
		int j1 = s1.length();
		if (V != j1)
			de = 85;
		else
			de = 99;
		s1 = null;
	}

	void h(int i1)
	{
		bO -= i1;
		if (bO < 0)
		{
			bO += i1;
			return;
		}
		p  = this;
		if (bO < f + (bH * f - cI.getWidth() >> 1))
		{
			p 1 = this;
			bO = f + (bH * f - cI.getWidth() >> 1);
			af();
			return;
		}
		af();
		p 2 = this;
		int j1 = bO - (bH / 2) * f;
		if (j1 >= f)
		{
			p 3 = this;
			if (j1 < af * f - bH * f - f)
			{
				int k1 = da + i1;
				p 4 = this;
				if (k1 > (cI.getWidth() - bH * f) / 2)
				{
					int l1 = ch - 1;
					if (l1 >= 0)
					{
						j(l1);
						da = k1 - ((bd - bH) / 2) * f;
					}
				} else
				{
					da = k1;
				}
			}
		}
	}

	void for(int i1)
	{
		bN -= i1;
		if (bN < 0)
		{
			bN += i1;
			return;
		}
		p  = this;
		if (bN < b9 + (bF * b9 - cI.getHeight() >> 1))
		{
			p 1 = this;
			bN = b9 + (bF * b9 - cI.getHeight() >> 1);
			af();
			return;
		}
		af();
		p 2 = this;
		int j1 = bN - (bF / 2) * b9;
		if (j1 >= b9 && j1 < ad * b9 - bF * b9 - b9)
		{
			int k1 = c7 + i1;
			p 3 = this;
			if (k1 > (cI.getHeight() - bF * b9) / 2)
			{
				int l1 = ce - 1;
				if (l1 >= 0)
				{
					o(l1);
					c7 = k1 - b9;
				}
			} else
			{
				c7 = k1;
			}
		}
	}

	void v(int i1)
	{
		bO += i1;
		if (bO > af * f - f)
		{
			bO -= i1;
			return;
		}
		p  = this;
		if (bO + bu > af * f - f - (bH * f - cI.getWidth() >> 1))
		{
			p 1 = this;
			bO = af * f - f - bu - (bH * f - cI.getWidth() >> 1);
			af();
			return;
		}
		af();
		p 2 = this;
		int j1 = bO - (bH / 2) * f;
		if (j1 > f)
		{
			p 3 = this;
			if (j1 <= af * f - bH * f - f)
			{
				int k1 = da - i1;
				p 4 = this;
				if (k1 + bd * f < cI.getWidth() - (cI.getWidth() - bH * f) / 2)
				{
					int l1 = ch + 1;
					if (l1 + bd <= af)
					{
						l(l1);
						da = k1 + f;
					}
				} else
				if (bO > b4)
					da = k1;
			}
		}
	}

	void null(int i1)
	{
		bN += i1;
		if (bN > ad * b9 - b9)
		{
			bN -= i1;
			return;
		}
		p  = this;
		if (bN + cX > ad * b9 - b9 - (bF * b9 - cI.getHeight() >> 1))
		{
			p 1 = this;
			bN = ad * b9 - cX - b9 - (bF * b9 - cI.getHeight() >> 1);
			af();
			return;
		}
		af();
		p 2 = this;
		int j1 = bN - (bF / 2) * b9;
		if (j1 > b9 && j1 <= ad * b9 - bF * b9 - b9)
		{
			int k1 = c7 - i1;
			p 3 = this;
			if (k1 + bb * b9 < cI.getHeight() - (cI.getHeight() - bF * b9) / 2)
			{
				int l1 = ce + 1;
				if (l1 + bb <= ad)
				{
					void(l1);
					c7 = k1 + ((bb - bF) / 2) * b9;
				}
			} else
			if (bN > c8)
				c7 = k1;
		}
	}

	int a(int i1, Vector vector)
	{
		int j1 = 0;
		int k1 = vector.size();
		for (int l1 = 0; l1 < k1; l1++)
		{
			u u1 = (u)vector.elementAt(l1);
			if (u1.do == i1)
				j1++;
		}

		return j1;
	}

	boolean a(int i1, boolean flag, boolean flag1)
	{
		Vector vector = null;
		if (i1 < 100)
			vector = cH;
		else
			vector = int;
		int j1 = vector.size();
		for (int k1 = 0; k1 < j1; k1++)
		{
			ab ab1 = (ab)vector.elementAt(k1);
			if (ab1.do == i1)
				return ab1.if == flag && ab1.for == flag1;
		}

		return false;
	}

	void a(w w1)
	{
		int i1 = w1.for;
		int j1 = w1.do;
		int k1 = GameMidlet.a(cn, 100) + 200;
		k k2 = null;
		if (aZ == 12 && a(102, false, false))
		{
			k1 = 503;
			k2 = a(k1, -1, i1, j1, 300, 0);
		} else
		if ((aZ == 17 || aZ == 26) && a(6, false, false))
		{
			k1 = 501;
			k2 = a(k1, -1, i1, j1, 300, 0);
		} else
		if (aZ == 1 && a(101, false, false))
		{
			k1 = 502;
			k2 = a(k1, -1, i1, j1, 300, 0);
		} else
		{
			k2 = a(u.a(u.for(k1, this), 1, cG.cn, this), -1, i1, j1, 300, 0);
		}
		bT.addElement(k2);
		k2 = null;
	}

	void a(w w1, int i1)
	{
		w1.L -= i1;
		if (w1.L <= 0)
		{
			w1.char();
			if (GameMidlet.a(cn, 100) <= w1.N)
				a(w1);
			int j1 = if(w1);
			aQ.byte(j1);
			a(true, false, false);
		} else
		{
			w1.new(i1);
		}
	}

	int a(int i1, int ai1[][], int j1, c c10)
	{
		int k1;
		if (c10.try >= 100)
			k1 = ((ah)c10).e;
		else
			k1 = ((i)c10).A;
		if (i1 == 10 || i1 == 11 || i1 == 13 || i1 == 22 || i1 == 23 || i1 == 25 || i1 == 33 || i1 == 34 || i1 == 35 || i1 == 37 || i1 == 38 || i1 == 39 || i1 == 43 || i1 == 44 || i1 == 46 || i1 == 47 || i1 == 50 || i1 == 51 || i1 == 52 || i1 == 54 || i1 == 55 || i1 == 58 || i1 == 59 || i1 == 62 || i1 == 63 || i1 == 64 || i1 == 66 || i1 == 67 || i1 == 68 || i1 == 69 || i1 == 57 || i1 == 45)
			return 1;
		if (i1 == 57 || i1 == 45)
		{
			int l1 = ai1[j1][0];
			int i2 = ai1[j1][1];
			int j2 = l1 - 1;
			int k2 = l1 + 1;
			for (int l2 = 0; l2 < ai1.length; l2++)
			{
				if (ai1[l2][0] == j2 && ai1[l2][1] == i2 && k1 == 2)
					return 99;
				if (ai1[l2][0] == j2 && ai1[l2][1] == i2 && k1 == 3)
					return 99;
			}

		}
		return 0;
	}

	boolean new(int i1)
	{
		return i1 != 3 && i1 != 7 && i1 != 8 && i1 != 9 && i1 != 12 && i1 != 13 && i1 != 14 && i1 != 15 && i1 != 16 && i1 != 17 && i1 != 18 && i1 != 19 && i1 != 20 && i1 != 21 && i1 != 22 && i1 != 23 && i1 != 24 && i1 != 25 && i1 != 26 && i1 != 27 && i1 != 30 && i1 != 33 && i1 != 36 && i1 != 39 && i1 != 40 && i1 != 41;
	}

	boolean q(int i1)
	{
		return i1 != 5 && i1 != 6 && i1 != 7 && i1 != 13 && i1 != 14 && i1 != 15 && i1 != 21 && i1 != 22 && i1 != 23 && i1 != 24 && i1 != 25 && i1 != 29 && i1 != 30 && i1 != 31;
	}

	boolean y(int i1)
	{
		return i1 != 0 && i1 != 1 && i1 != 2 && i1 != 3 && i1 != 7 && i1 != 10 && i1 != 14 && i1 != 17 && i1 != 21 && i1 != 22 && i1 != 23 && i1 != 24 && i1 != 28 && i1 != 29 && i1 != 30 && i1 != 31 && i1 != 35 && i1 != 36 && i1 != 37 && i1 != 38 && i1 != 42 && i1 != 43 && i1 != 44 && i1 != 45;
	}

	int if(int i1, int ai1[][], int j1, c c10)
	{
		int k1;
		if (c10.try >= 100)
			k1 = ((ah)c10).e;
		else
			k1 = ((i)c10).A;
		if (i1 == 0 || i1 == 1 || i1 == 4 || i1 == 5 || i1 == 8 || i1 == 14 || i1 == 15 || i1 == 19 || i1 == 20 || i1 == 21)
			return 1;
		if (i1 == 20 || i1 == 21)
		{
			int l1 = ai1[j1][0];
			int i2 = ai1[j1][1];
			int j2 = l1 - 1;
			int k2 = l1 + 1;
			for (int l2 = 0; l2 < ai1.length; l2++)
			{
				if (ai1[l2][0] == j2 && ai1[l2][1] == i2 && k1 == 2)
					return 99;
				if (ai1[l2][0] == j2 && ai1[l2][1] == i2 && k1 == 3)
					return 99;
			}

		}
		return 0;
	}

	void Q()
	{
		if (U != null && U.length > 0)
		{
			for (int i1 = 0; i1 < U.length; i1++)
			{
				if (U[i1] == aQ || U[i1].try < 3 || U[i1].try < 100 && (((w)U[i1]).p == 7 || ((w)U[i1]).p == 6 || ((w)U[i1]).p == 9 || ((w)U[i1]).p == 8))
					continue;
				int ai1[] = null;
				ai1 = for(U[i1]);
				int ai2[] = null;
				ai2 = for(aQ);
				int j1 = U[i1].for;
				int k1 = U[i1].do;
				if (U[i1].try >= 100)
				{
					if (((ah)U[i1]).b.try >= 50 && a(j1, k1, ai1[0], ai1[1], aQ.for, aQ.do + (if(aQ) - ai2[1]), ai2[0], ai2[1]))
					{
						a(((ah)U[i1]).b, aQ);
						return;
					}
					continue;
				}
				if (a(j1, k1, ai1[0], ai1[1], aQ.for, aQ.do + (if(aQ) - ai2[1]), ai2[0], ai2[1]))
				{
					a((w)(w)U[i1], aQ);
					return;
				}
			}

		}
	}

	int a(int i1, int j1, int k1, int l1, c c10)
	{
		if ((c10.try < 3 || c10.try >= 100) && U != null && U.length > 0)
		{
			for (int i2 = 0; i2 < U.length; i2++)
			{
				if (c10.try == 2 && U[i2].try >= 3 || U[i2] == c10)
					continue;
				int ai2[] = null;
				c c11 = U[i2];
				int l2 = c11.for;
				int j3 = c11.do;
				if (c10.try >= 100)
				{
					if (((ah)c10).b == U[i2] || U[i2].try < 3 || ((ah)c10).b.try != 2 || U[i2].try < 100 && (((w)U[i2]).p == 7 || ((w)U[i2]).p == 6 || ((w)U[i2]).p == 9))
						continue;
					ai2 = new int[2];
					ai2[0] = do(c11);
					ai2[1] = if(c11);
				} else
				{
					ai2 = for(c11);
				}
				l2 += do(c11) - ai2[0];
				j3 += if(c11) - ai2[1];
				if (a(i1, j1, k1, l1, l2, j3, ai2[0], ai2[1]))
				{
					if (c10.try >= 100 && U[i2].try >= 3 && U[i2].try < 50)
						a((w)U[i2], a(aQ, (w)U[i2]));
					return 1;
				}
				ai2 = null;
			}

		}
		int ai1[][] = do(i1, j1, k1, l1);
		for (int j2 = 0; j2 < ai1.length; j2++)
		{
			if (ai1[j2][0] < 1 || ai1[j2][0] >= af - 1 || ai1[j2][1] < 1 || ai1[j2][1] >= ad - 1)
				return 1;
			byte byte0 = c2[ai1[j2][0]][ai1[j2][1]];
			switch (dd)
			{
			default:
				break;

			case 1: // '\001'
				if (byte0 < 38 && byte0 != 19 && byte0 != 9 && byte0 != 31)
					return 1;
				break;

			case 2: // '\002'
				if (byte0 < 16)
					return 1;
				break;

			case 3: // '\003'
				if (byte0 < 30)
					return 1;
				break;

			case 4: // '\004'
				if (byte0 < 27 && byte0 != 23 && byte0 != 17 && byte0 != 11 && byte0 != 13)
					return 1;
				break;

			case 5: // '\005'
				if (byte0 < 6)
					return 1;
				break;
			}
		}

		for (int k2 = 0; k2 < ai1.length; k2++)
		{
			if (ai1[k2][0] < 1 || ai1[k2][0] >= af - 1 || ai1[k2][1] < 1 || ai1[k2][1] >= ad - 1)
				return 1;
			byte byte1 = ay[ai1[k2][0]][ai1[k2][1]];
			switch (dd)
			{
			default:
				break;

			case 1: // '\001'
				int i3 = a(byte1, ai1, k2, c10);
				if (i3 != 0)
					return i3;
				break;

			case 2: // '\002'
				if (!y(byte1))
					return 1;
				break;

			case 3: // '\003'
				int k3 = if(byte1, ai1, k2, c10);
				if (k3 != 0)
					return k3;
				break;

			case 4: // '\004'
				if (!q(byte1))
					return 1;
				break;

			case 5: // '\005'
				if (!new(byte1))
					return 1;
				break;
			}
		}

		ai1 = (int[][])null;
		return 0;
	}

	int if(int i1, int j1, int k1, int l1, c c10)
	{
		int i2 = k1;
		int j2 = l1;
		switch (i1)
		{
		case 0: // '\0'
			j2 -= j1;
			break;

		case 1: // '\001'
			j2 += j1;
			break;

		case 2: // '\002'
			i2 -= j1;
			break;

		case 3: // '\003'
			i2 += j1;
			break;
		}
		int ai1[] = for(c10);
		if (c10.try == 100 || c10.try == 101 || c10.try == 102 || c10.try == 103 || c10.try == 104 || c10.try == 105 || c10.try == 106 || c10.try == 107 || c10.try == 108 || c10.try == 109)
		{
			if (((ah)c10).null == 2 || ((ah)c10).null == 3)
			{
				i2 += (do(c10) - ai1[0]) / 2;
				j2 += (if(c10) - ai1[1]) / 2;
			} else
			{
				i2 += (if(c10) - ai1[0]) / 2;
				j2 += (do(c10) - ai1[1]) / 2;
			}
		} else
		{
			i2 += do(c10) - ai1[0];
			j2 += if(c10) - ai1[1];
		}
		return a(i2, j2, ai1[0], ai1[1], c10);
	}

	void p(int i1)
	{
		if (aQ != null && aQ.p == 5 && aQ.au)
			return;
		boolean flag = false;
		boolean flag1 = false;
		boolean flag2 = false;
		switch (i1)
		{
		case 0: // '\0'
		case 1: // '\001'
		case 2: // '\002'
		case 3: // '\003'
		case 4: // '\004'
		case 5: // '\005'
		case 6: // '\006'
		case 7: // '\007'
		case 8: // '\b'
		case 9: // '\t'
		case 10: // '\n'
		case 11: // '\013'
		case 12: // '\f'
		case 13: // '\r'
		case 14: // '\016'
		case 15: // '\017'
		case 16: // '\020'
		case 17: // '\021'
		case 18: // '\022'
		case 19: // '\023'
		case 20: // '\024'
		case 21: // '\025'
		case 22: // '\026'
		case 23: // '\027'
		case 24: // '\030'