⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 s.java

📁 很好的3款手机游戏源码
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
			if (a_int_array1d[1] < r.a_int_array1d_static[1] + r.a_int_array2d_static[b_int][1])
				a_int_array1d[1] += (r.a_int_array2d_static[b_int][1] - r.b_int_array1d_static[1]) / 4;
			break;

		case -1: 
			if (a_int_array1d[0] > r.a_int_array1d_static[0] + r.a_int_array2d_static[b_int][0])
				a_int_array1d[0] -= ((r.c[0] - r.a_int_array2d_static[b_int][0]) + H) / 4;
			if (a_int_array1d[1] > r.a_int_array1d_static[1] + r.a_int_array2d_static[b_int][1])
				a_int_array1d[1] -= (r.c[1] - r.a_int_array2d_static[b_int][1]) / 4;
			if (a_int_array1d[1] < r.a_int_array1d_static[1] + r.a_int_array2d_static[b_int][1])
				a_int_array1d[1] += (r.a_int_array2d_static[b_int][1] - r.c[1]) / 4;
			break;
		}
		a_u.a(a_int_array1d[0], a_int_array1d[1]);
		if (a_int_array1d[0] <= r.a_int_array1d_static[0] + r.a_int_array2d_static[b_int][0])
		{
			a_int_array1d[0] = r.a_int_array1d_static[0] + r.a_int_array2d_static[b_int][0];
			a_int_array1d[1] = r.a_int_array1d_static[1] + r.a_int_array2d_static[b_int][1];
			v = 1;
			C = 0;
			D = 0;
			A = 0;
			b_boolean = false;
			a_u.a(0, a_int_array1d[0], a_int_array1d[1]);
		}
	}

	private void m()
	{
		if (!r.b_boolean_static)
		{
			C++;
			if (C > B)
			{
				p();
				q();
				if (v == 3)
				{
					C -= n.c_p_static.a("skill_" + a_b.a_int + ".t_Cost");
					a_u.a(3, a_int_array1d[0], a_int_array1d[1]);
				} else
				{
					b_boolean = true;
				}
			}
		}
	}

	private void n()
	{
		if (a_u.a != 3)
			a_u.a(3, a_int_array1d[0], a_int_array1d[1]);
		if (!r.b_boolean_static)
		{
			C++;
			if (C > B)
			{
				b_boolean = true;
				v = 4;
				switch (x)
				{
				default:
					break;

				case -2: 
					if (j.k <= 0 && c.c > 0)
						x = -1;
					break;

				case -1: 
					if (c.c <= 0 && j.k > 0)
						x = -2;
					break;

				case 0: // '\0'
				case 1: // '\001'
				case 2: // '\002'
					if (r.a_s_array1d_static[x].h <= 0)
						x = c_int;
					break;
				}
				int i1 = 0;
				int j1 = 0;
				switch (a_b.a_int)
				{
				default:
					break;

				case 0: // '\0'
					i1 = r.a_s_array1d_static[x].a_int_array1d[0];
					j1 = r.a_s_array1d_static[x].a_int_array1d[1];
					break;

				case 1: // '\001'
				case 3: // '\003'
				case 5: // '\005'
				case 6: // '\006'
				case 7: // '\007'
					switch (x)
					{
					case -2: 
						i1 = j.a[0];
						j1 = j.a[1];
						break;

					case -1: 
						i1 = c.a[0];
						j1 = c.a[1];
						break;
					}
					break;

				case 2: // '\002'
				case 4: // '\004'
					i1 = (j.a[0] + c.a[0]) / 2;
					j1 = (j.a[1] + c.a[1]) / 2;
					break;
				}
				a_b.a(i1, j1);
				i -= a_b.b;
			}
		}
	}

	private void o()
	{
		switch (x)
		{
		default:
			break;

		case -2: 
			if (a_int_array1d[0] < j.a[0] + H)
				a_int_array1d[0] += ((r.b_int_array1d_static[0] - r.a_int_array2d_static[b_int][0]) + H) / 4;
			if (a_int_array1d[1] < j.a[1])
				a_int_array1d[1] += (r.b_int_array1d_static[1] - r.a_int_array2d_static[b_int][1]) / 4;
			if (a_int_array1d[1] > j.a[1])
				a_int_array1d[1] -= (r.a_int_array2d_static[b_int][1] - r.b_int_array1d_static[1]) / 4;
			a_u.a(a_int_array1d[0], a_int_array1d[1]);
			if (a_int_array1d[0] >= j.a[0] + H)
			{
				a_int_array1d[0] = j.a[0] + H;
				a_int_array1d[1] = j.a[1];
				v = 2;
				F = 0;
				if (n.a(0, 99) < u)
				{
					a_u.a(1, a_int_array1d[0], a_int_array1d[1]);
				} else
				{
					F = -1;
					a_u.a(2, a_int_array1d[0], a_int_array1d[1]);
				}
			}
			break;

		case -1: 
			if (a_int_array1d[0] < c.a[0] + H)
			{
				int i1 = ((r.c[0] - r.a_int_array2d_static[b_int][0]) + H) / 4;
				if (i1 < 1)
					i1 = 1;
				a_int_array1d[0] += i1;
			}
			if (a_int_array1d[1] < c.a[1])
			{
				int j1 = (r.c[1] - r.a_int_array2d_static[b_int][1]) / 4;
				if (j1 < 1)
					j1 = 1;
				a_int_array1d[1] += j1;
			}
			if (a_int_array1d[1] > c.a[1])
			{
				int k1 = (r.a_int_array2d_static[b_int][1] - r.c[1]) / 4;
				if (k1 < 1)
					k1 = 1;
				a_int_array1d[1] -= k1;
			}
			a_u.a(a_int_array1d[0], a_int_array1d[1]);
			if (a_int_array1d[0] < c.a[0] + H || a_int_array1d[1] < c.a[1])
				break;
			a_int_array1d[0] = c.a[0] + H;
			a_int_array1d[1] = c.a[1];
			v = 2;
			F = 0;
			if (n.a(0, 99) < u)
			{
				a_u.a(1, a_int_array1d[0], a_int_array1d[1]);
			} else
			{
				F = -1;
				a_u.a(2, a_int_array1d[0], a_int_array1d[1]);
			}
			break;
		}
	}

	private void p()
	{
		switch (a_int)
		{
		default:
			break;

		case 0: // '\0'
			if (h < f / 2 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 1: // '\001'
			if (j.k > 0 && j.T - j.U <= 10 || c.c > 0 && c.x - c.y <= 10 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 2: // '\002'
			if (h > f / 2 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 3: // '\003'
		case 9: // '\t'
			if (i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 4: // '\004'
			if (h < f / 2 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 5: // '\005'
			if (n.a(0, 99) < 33 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 6: // '\006'
			if (h < (f * 40) / 100 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 7: // '\007'
			if (i >= a_b.b)
			{
				for (int i1 = 0; i1 < r.a_int_static; i1++)
					if (r.a_s_array1d_static[i1].h > 0 && r.a_s_array1d_static[i1].h < (r.a_s_array1d_static[i1].f * 30) / 100)
					{
						v = 3;
						return;
					}

			} else
			{
				v = 16;
			}
			// fall through

		case 8: // '\b'
			if (n.a(0, 99) < 33 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;

		case 10: // '\n'
		case 11: // '\013'
		case 12: // '\f'
			if (n.a(0, 99) < 33 && i >= a_b.b)
				v = 3;
			else
				v = 16;
			break;
		}
	}

	private void q()
	{
label0:
		switch (a_int)
		{
		default:
			break;

		case 0: // '\0'
			if (j.k > 0 && c.c > 0)
			{
				if (j.x + j.y < c.j)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;

		case 1: // '\001'
			if (j.k > 0 && c.c > 0)
			{
				if (j.T - j.U < c.x - c.y)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;

		case 2: // '\002'
			if (j.k > 0 && c.c > 0)
			{
				if (j.k < c.c)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;

		case 3: // '\003'
		case 9: // '\t'
			if (j.k > 0 && c.c > 0)
			{
				if (j.x + j.y > c.j)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;

		case 4: // '\004'
			if (j.k > 0 && c.c > 0)
			{
				if (j.l > c.d)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			// fall through

		case 5: // '\005'
			if (j.k > 0 && c.c > 0)
			{
				if (j.B + j.C < c.l)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;

		case 6: // '\006'
			switch (v)
			{
			default:
				break;

			case 3: // '\003'
				x = -4;
				break label0;

			case 16: // '\020'
				if (j.k > 0 && c.c > 0)
				{
					if (j.D + j.E < c.m)
						x = -2;
					else
						x = -1;
					break label0;
				}
				if (j.k > 0)
					x = -2;
				else
					x = -1;
				break;
			}
			break;

		case 7: // '\007'
			boolean flag = false;
			char c1 = '\u03E7';
			switch (v)
			{
			default:
				break;

			case 3: // '\003'
				switch (r.a_int_static)
				{
				default:
					break;

				case 1: // '\001'
					x = 0;
					break label0;

				case 2: // '\002'
					int i1 = 0;
					int k1 = 999;
					for (int i2 = 0; i2 < 2; i2++)
						if (r.a_s_array1d_static[i2].h < k1 && r.a_s_array1d_static[i2].h > 0)
						{
							i1 = i2;
							k1 = r.a_s_array1d_static[i2].h;
						}

					switch (i1)
					{
					case 0: // '\0'
						x = 0;
						break;

					default:
						x = 1;
						break;
					}
					break label0;

				case 3: // '\003'
					int j1 = 0;
					int l1 = 999;
					for (int j2 = 0; j2 < 3; j2++)
						if (r.a_s_array1d_static[j2].h < l1 && r.a_s_array1d_static[j2].h > 0)
						{
							j1 = j2;
							l1 = r.a_s_array1d_static[j2].h;
						}

					switch (j1)
					{
					case 0: // '\0'
						x = 0;
						break;

					case 1: // '\001'
						x = 1;
						break;

					default:
						x = 2;
						break;
					}
					break;
				}
				break label0;

			case 16: // '\020'
				if (j.k > 0 && c.c > 0)
				{
					if (j.z + j.A > c.k)
						x = -2;
					else
						x = -1;
					break label0;
				}
				if (j.k > 0)
					x = -2;
				else
					x = -1;
				break;
			}
			break;

		case 8: // '\b'
			switch (v)
			{
			default:
				break;

			case 3: // '\003'
				x = -4;
				break label0;

			case 16: // '\020'
				if (j.k > 0 && c.c > 0)
				{
					if (n.a(0, 99) < 50)
						x = -2;
					else
						x = -1;
					break label0;
				}
				if (j.k > 0)
					x = -2;
				else
					x = -1;
				break;
			}
			break;

		case 10: // '\n'
		case 11: // '\013'
		case 12: // '\f'
			if (j.k > 0 && c.c > 0)
			{
				if (n.a(0, 99) < 50)
					x = -2;
				else
					x = -1;
				break;
			}
			if (j.k > 0)
				x = -2;
			else
				x = -1;
			break;
		}
	}

}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -