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

📄 l.java

📁 很好的3款手机游戏源码
💻 JAVA
字号:
// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 

import javax.microedition.lcdui.Graphics;
import javax.microedition.lcdui.Image;

public class l
{

	private static int a_int_static;
	private static int b_int_static;
	private static boolean a_boolean_static;
	private static boolean b_boolean_static;
	private static int c_int_static;
	private static int d;
	private static int e;
	private static int f;
	private static int g;
	private static int h;
	private static int i;
	private static int j;
	private static int k;
	private static int l;
	private static Image a_javax_microedition_lcdui_Image_static;
	private static int a_int_array2d_static[][];
	private static int m;
	private static int n;
	private static int o;
	private static boolean c_boolean_static;
	private static int p;
	private static int q;
	private static int r;
	private static int b_int_array2d_static[][];
	private static final int a_int_array1d_static[] = {
		0x798c8a, 0xa2b6b4, 0xc8d9d7
	};
	private static int s;

	public l()
	{
	}

	public static void a(int i1, int j1, boolean flag, boolean flag1, int k1, int l1, int i2, int j2, 
			int k2, int l2, int i3, int j3)
	{
		a_int_static = i1;
		b_int_static = j1;
		a_boolean_static = flag;
		b_boolean_static = flag1;
		if (flag1)
		{
			c_int_static = -n.a.e + e.a / 2;
			d = -n.a.f + e.b / 2;
		} else
		{
			c_int_static = 0;
			d = 0;
		}
		e = k1;
		f = l1;
		g = i2;
		h = j2;
		i = k2;
		j = l2;
		k = i3;
		l = j3;
		switch (i1)
		{
		case 1: // '\001'
		case 3: // '\003'
			b();
			// fall through

		case 2: // '\002'
			a();
			// fall through

		default:
			return;
		}
	}

	public static void a()
	{
		b_int_array2d_static = new int[b_int_static][6];
	}

	public static void b()
	{
		switch (a_int_static)
		{
		case 1: // '\001'
			m = -2;
			n = 2;
			o = 10;
			a_javax_microedition_lcdui_Image_static = t.a("/leaf.png");
			break;

		case 3: // '\003'
			m = 1;
			n = -3;
			o = 10;
			a_javax_microedition_lcdui_Image_static = t.a("/flame.png");
			break;
		}
		a_int_array2d_static = new int[b_int_static][5];
		if (a_boolean_static)
		{
			for (int i1 = 0; i1 < b_int_static; i1++)
			{
				a_int_array2d_static[i1][0] = n.a(1, 5);
				a_int_array2d_static[i1][1] = n.a(i, k);
				a_int_array2d_static[i1][2] = n.a(j, l);
				a_int_array2d_static[i1][3] = m + (n.a(0, 2) - 1);
				a_int_array2d_static[i1][4] = n + (n.a(0, 2) - 1);
			}

		}
	}

	public static void a(Graphics g1)
	{
		switch (a_int_static)
		{
		case 1: // '\001'
		case 3: // '\003'
			c(g1);
			break;

		case 2: // '\002'
			b(g1);
			break;
		}
	}

	private static void b(Graphics g1)
	{
		g1.setClip(0, 0, e.a, e.b);
		if (s > 0 && s % 2 == 1)
		{
			g1.setColor(0xffffff);
			g1.fillRect(0, 0, e.a, e.b);
		}
		for (int i1 = 0; i1 < b_int_static; i1++)
			if (b_int_array2d_static[i1][0] > 0)
			{
				g1.setColor(a_int_array1d_static[b_int_array2d_static[i1][0] - 1]);
				g1.drawLine(b_int_array2d_static[i1][1] + c_int_static, b_int_array2d_static[i1][2] + d, b_int_array2d_static[i1][1] + c_int_static + b_int_array2d_static[i1][3] / 2, (b_int_array2d_static[i1][2] + d) - b_int_array2d_static[i1][3]);
			}

	}

	private static void c(Graphics g1)
	{
		for (int i1 = 0; i1 < b_int_static; i1++)
			if (a_int_array2d_static[i1][1] > i && a_int_array2d_static[i1][1] + 9 < i + k && a_int_array2d_static[i1][2] > j && a_int_array2d_static[i1][2] + 9 < j + l)
			{
				g1.setClip(a_int_array2d_static[i1][1] + c_int_static, a_int_array2d_static[i1][2] + d, 9, 9);
				g1.drawImage(a_javax_microedition_lcdui_Image_static, (a_int_array2d_static[i1][1] - a_int_array2d_static[i1][0] * 9) + c_int_static, a_int_array2d_static[i1][2] + d, 0);
			}

	}

	public static void c()
	{
		d();
		switch (a_int_static)
		{
		case 1: // '\001'
		case 3: // '\003'
			f();
			break;

		case 2: // '\002'
			e();
			break;
		}
	}

	private static void d()
	{
		if (b_boolean_static)
		{
			c_int_static = -n.a.e + e.a / 2;
			d = -n.a.f + e.b / 2;
		}
	}

	private static void e()
	{
		if (!c_boolean_static)
		{
			if (r > 8)
				r -= r / 8;
			else
				r = 0;
			if (n.a(0, 99) < 1 && r == 0)
			{
				c_boolean_static = true;
				s = 3;
				p = 0;
				q = 250 + (n.a(0, 125) - 62);
			}
		} else
		{
			if (p == 10)
				r = 8;
			if (r < b_int_static)
				r += r / 8;
			else
				r = b_int_static;
			if (p < q)
			{
				p++;
			} else
			{
				p = 0;
				c_boolean_static = false;
				s = 0;
			}
			if (s == 0)
			{
				if (n.a(0, 99) < 2)
					s = n.a(1, 3);
			} else
			{
				s--;
				if (s < 0)
					s = 0;
			}
		}
		for (int i1 = 0; i1 < b_int_static; i1++)
		{
			if (b_int_array2d_static[i1][0] == 0)
			{
				if (i1 < r && n.a(0, 99) < 50)
				{
					b_int_array2d_static[i1][0] = n.a(1, 3);
					b_int_array2d_static[i1][1] = n.a(e, e + g);
					b_int_array2d_static[i1][2] = n.a(f, f + h);
					b_int_array2d_static[i1][3] = b_int_array2d_static[i1][0] * 12 + (n.a(0, b_int_array2d_static[i1][0] * 4) - 3);
					b_int_array2d_static[i1][4] = 24 + (n.a(0, 2) - 1);
					b_int_array2d_static[i1][5] = n.a(j, j + l);
				}
				continue;
			}
			b_int_array2d_static[i1][1] -= b_int_array2d_static[i1][4] / 2;
			b_int_array2d_static[i1][2] += b_int_array2d_static[i1][4];
			if (b_int_array2d_static[i1][1] + b_int_array2d_static[i1][3] / 2 < i || b_int_array2d_static[i1][2] - b_int_array2d_static[i1][3] > b_int_array2d_static[i1][5])
			{
				b_int_array2d_static[i1][0] = 0;
				b_int_array2d_static[i1][1] = 0;
				b_int_array2d_static[i1][2] = 0;
				b_int_array2d_static[i1][3] = 0;
				b_int_array2d_static[i1][4] = 0;
				b_int_array2d_static[i1][5] = 0;
			}
		}

	}

	private static void f()
	{
		for (int i1 = 0; i1 < b_int_static; i1++)
		{
			if (a_int_array2d_static[i1][0] == 0)
			{
				if (n.a(0, 99) < o)
				{
					a_int_array2d_static[i1][0] = n.a(1, 5);
					a_int_array2d_static[i1][1] = n.a(e, e + g);
					a_int_array2d_static[i1][2] = n.a(f, f + h);
					a_int_array2d_static[i1][3] = m + (n.a(0, 2) - 1);
					a_int_array2d_static[i1][4] = n + (n.a(0, 2) - 1);
				}
				continue;
			}
			a_int_array2d_static[i1][1] += a_int_array2d_static[i1][3];
			a_int_array2d_static[i1][2] += a_int_array2d_static[i1][4];
			boolean flag = false;
			switch (a_int_static)
			{
			case 1: // '\001'
				flag = a_int_array2d_static[i1][1] < i || a_int_array2d_static[i1][1] > i + k || a_int_array2d_static[i1][2] > j + l;
				break;

			case 3: // '\003'
				flag = a_int_array2d_static[i1][1] > i + k || a_int_array2d_static[i1][2] < j;
				break;
			}
			if (flag)
			{
				a_int_array2d_static[i1][0] = 0;
				a_int_array2d_static[i1][1] = 0;
				a_int_array2d_static[i1][2] = 0;
				a_int_array2d_static[i1][3] = 0;
				a_int_array2d_static[i1][4] = 0;
			}
		}

	}

}

⌨️ 快捷键说明

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