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

📄 n.java

📁 j2me 武林传之刀剑江湖录[前篇]反编译源代码
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
	};
	private static final int C[][][] = {
		{
			{
				15, 0, 0, 0, 0
			}, {
				30, 0, 0, 0, 0
			}, {
				45, 0, 0, 0, 0
			}, {
				60, 0, 0, 0, 0
			}, {
				75, 0, 0, 0, 0
			}, {
				90, 0, 0, 0, 0
			}, {
				105, 0, 0, 0, 0
			}, {
				120, 0, 0, 0, 0
			}, {
				135, 0, 0, 0, 0
			}, {
				150, 0, 0, 0, 0
			}
		}, {
			{
				40, 20, 0, 0, 0
			}, {
				50, 25, 0, 0, 0
			}, {
				60, 30, 0, 0, 0
			}, {
				70, 35, 0, 0, 0
			}, {
				80, 40, 0, 0, 0
			}, {
				90, 45, 0, 0, 0
			}, {
				100, 50, 0, 0, 0
			}, {
				110, 55, 0, 0, 0
			}, {
				120, 60, 0, 0, 0
			}, {
				130, 65, 0, 0, 0
			}
		}, {
			{
				10, 1, 0, 0, 0
			}, {
				15, 1, 0, 0, 0
			}, {
				20, 2, 0, 0, 0
			}, {
				25, 2, 0, 0, 0
			}, {
				30, 3, 0, 0, 0
			}, {
				35, 4, 0, 0, 0
			}, {
				40, 5, 0, 0, 0
			}, {
				45, 6, 0, 0, 0
			}, {
				50, 7, 0, 0, 0
			}, {
				55, 8, 0, 0, 0
			}
		}, {
			{
				20, 20, 0, 0, 0
			}, {
				30, 21, 0, 0, 0
			}, {
				40, 22, 0, 0, 0
			}, {
				50, 23, 0, 0, 0
			}, {
				60, 24, 0, 0, 0
			}, {
				70, 25, 0, 0, 0
			}, {
				80, 26, 0, 0, 0
			}, {
				90, 27, 0, 0, 0
			}, {
				100, 28, 0, 0, 0
			}, {
				110, 29, 0, 0, 0
			}
		}, {
			{
				0, 0, 10, 5, 1
			}, {
				0, 0, 20, 10, 2
			}, {
				0, 0, 30, 15, 3
			}, {
				0, 0, 40, 20, 4
			}, {
				0, 0, 50, 25, 5
			}, {
				0, 0, 60, 30, 6
			}, {
				0, 0, 70, 35, 7
			}, {
				0, 0, 80, 40, 8
			}, {
				0, 0, 90, 45, 9
			}, {
				0, 0, 100, 50, 10
			}
		}, {
			{
				0, 0, 120, 55, 2
			}, {
				0, 0, 140, 60, 4
			}, {
				0, 0, 160, 65, 6
			}, {
				0, 0, 180, 70, 8
			}, {
				0, 0, 200, 75, 10
			}, {
				0, 0, 220, 80, 12
			}, {
				0, 0, 240, 85, 14
			}, {
				0, 0, 260, 90, 16
			}, {
				0, 0, 280, 95, 18
			}, {
				0, 0, 300, 100, 20
			}
		}
	};
	public static short w[][] = {
		{
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}, {
			0, 0
		}
	};
	public static final String x[] = {
		"刺杀", "聂凡奉命刺杀江南大侠慕容词,却反被慕容词击伤,面对阻截的黑衣人,聂凡是否能完成任务?", "吴村", "身受重伤的聂凡被村女小茜所救,在吴村养伤,直到三个月后才伤势痊愈,可是内力却大大受损。", "苏州", "击败山贼得到半本易筋经后的聂凡回到吴村,却发现小茜去了苏州,到底是因为什么事才走的如此匆忙,或许苏州的郑羊会给出答案。", "阴谋", "小茜竟然被玄空带去慕容山庄与慕容词对质了,这里面一定有阴谋,现在的当务之急是回到苏州,从那可以到达慕容山庄。", "少林寺", "从郑羊的家中发现了少林寺将开英雄大会的消息,并得到了一张密道地图。他们要干什么?小茜到底是什么人?在少林寺或许能找到答案。", 
		"西域归来", "总算拿到了易筋经经书,再路途中聂凡也学会了另外半部经书,以前受的内伤已经完全恢复了,甚至更强!", "西域", "从少林寺出来后,要去西域拜火教拿回另外半部经书,但是拜火教的具体位置仍不知道,或许镇子里有人知道。", "慕容山庄", "慕容山庄在苏州城的西边,速去救出小茜,而事情的真相似乎也将在那里揭开……", "吴老板的生意", "从苏州运往吴老板的货物最近经常给村外的山贼抢走,导致吴老板店里缺货,有机会就帮吴老板消灭这帮山贼吧。", "西域驿线", "西域的驿站希望能开辟到达江南的路线,希望我带一封信去那里的驿站。", 
		"西域马刀", "苏州城铁匠老王头想要一把西域打造的马刀,但是却怎么也买不到,看来只有去西域才能买到了。", "天山雪莲", "苏州杂货铺急缺一种名为“天山雪莲”的名贵药材,据说只有在西域才能买得到。杂货铺的张老板希望能弄到10颗天山雪莲。", "通缉马贼头领", "龙门镇外的戈壁大漠常有马贼出没,危害百姓。龙门镇镇长委托武艺高强的侠士帮忙抓捕马贼头领,为此将支付高额的报酬!", "讨伐马贼", "马贼头领被抓后,其残余团伙集结在一起,欲要攻击龙门镇,救出头领。龙门镇镇长为此十分的担忧。", "二娃的笛子", "渔村牧童二娃的笛子坏了,但是因为家里穷,买不起新的笛子,而周围也似乎没有卖笛子的商家。", 
		"铜人阵", "据说少林寺的铜人阵威力非凡,凡是能独自闯过去的人,就能晋升一流高手的行列。", "轻功捉鱼", "苏州城的池塘里有一条狡猾的大鱼,连渔夫都捉不到,或许运用轻功可以在鱼跃出水面的一刹那捉到它!", "抓鸟", "苏州城的小孩希望能抓到对面屋顶上的鸟,但是首先得想办法跳到房子上才行。", "狗的宝藏", "", "神秘商人", "", 
		"神秘事件1", "", "神秘事件2", "", "姑娘对话", ""
	};

	public n()
	{
		g = new short[19];
		h = new short[6];
	}

	public static final boolean a(n n1, n n2)
	{
		if (!n1.f.equals(n2.f))
			return false;
		for (int i1 = n1.g.length - 1; i1 >= 0; i1--)
			if (n1.g[i1] != n2.g[i1])
				return false;

		for (int j1 = n1.h.length - 1; j1 >= 0; j1--)
			if (n1.h[j1] != n2.h[j1])
				return false;

		return true;
	}

	private static final String a(short word0)
	{
		if (word0 >= 0)
			return y[word0];
		else
			return "";
	}

	private static final void a(n n1)
	{
		short word0 = n1.g[14];
		for (int i1 = 0; i1 < z[0].length; i1++)
			if (z[word0][i1].length != 0)
			{
				if (i1 != 3)
				{
					short word2 = z[word0][i1][0];
					short word3 = z[word0][i1][1];
					int l1 = u.b(word2, word3);
					n1.g[i1] = (short)l1;
				}
			} else
			{
				n1.g[i1] = 0;
			}

		short word1 = 0;
label0:
		for (int j1 = 0; j1 < n1.h.length; j1++)
		{
			switch (j1)
			{
			case 0: // '\0'
				word1 = n1.g[11];
				break;

			case 1: // '\001'
				word1 = n1.g[12];
				break;

			case 2: // '\002'
				word1 = n1.g[13];
				break;

			case 3: // '\003'
				word1 = n1.g[4];
				break;

			case 4: // '\004'
				word1 = n1.g[5];
				break;

			case 5: // '\005'
				word1 = n1.g[6];
				break;
			}
			if (word1 == 0)
				continue;
			int k1 = u.b(100);
			int i2 = 100;
			int j2 = 0;
			do
			{
				if (j2 >= d[j1].length)
					continue label0;
				if (k1 < i2 && k1 >= i2 - d[j1][j2][0])
				{
					n1.h[j1] = (short)j2;
					continue label0;
				}
				i2 -= d[j1][j2][0];
				j2++;
			} while (true);
		}

	}

	private static final String b(short word0)
	{
		if (word0 >= 0)
			return A[word0];
		else
			return "";
	}

	private static final byte c(short word0)
	{
		if (word0 >= 0)
			return e[word0];
		else
			return -1;
	}

	private static final void b(n n1)
	{
		short word0 = n1.g[15];
		for (int i1 = 0; i1 < B[word0].length; i1++)
			if (i1 != 3)
				n1.g[i1] += B[word0][i1];

		n1.g[17] = B[word0][3];
	}

	public static final n a(int i1, int j1)
	{
		n n1;
		(n1 = new n()).g[16] = c((short)j1);
		n1.g[14] = (short)i1;
		n1.g[15] = (short)j1;
		if (i1 >= 0)
			a(n1);
		if (j1 >= 0)
			b(n1);
		n1.f = a(n1.g[14]) + b(n1.g[15]);
		n1.i = (short)j1;
		return n1;
	}

	public final String toString()
	{
		String s1 = f + ":";
		for (int i1 = 0; i1 < 19; i1++)
			if (g[i1] != 0)
				s1 = s1 + "   " + a[i1] + "=" + g[i1];

		s1 = s1 + "附加攻击属性:";
		for (int j1 = 0; j1 < h.length; j1++)
			if (h[j1] >= 0)
				s1 = s1 + j[j1] + "[" + h[j1] + "级];";

		return s1;
	}

	public final short a()
	{
		return g[2];
	}

	public final short b()
	{
		return g[16];
	}

	public final short c()
	{
		return g[17];
	}

	public final String d()
	{
		String s1 = "<" + f + ">&";
		short word0 = 0;
		if ((word0 = g[0]) > 0)
			s1 = s1 + "攻击+" + word0 + ";";
		if ((word0 = g[1]) > 0)
			s1 = s1 + "防御+" + word0 + ";";
		if ((word0 = g[7]) > 0)
			s1 = s1 + "生命+" + word0 + ";";
		if ((word0 = g[8]) > 0)
			s1 = s1 + "内力+" + word0 + ";";
		if ((word0 = g[9]) > 0)
			s1 = s1 + "生命+" + word0 + ";";
		if ((word0 = g[10]) > 0)
			s1 = s1 + "会心+" + word0 + ";";
		if (g[11] > 0)
			s1 = s1 + "冰攻:" + (h[0] + 1) + "级;";
		if (g[12] > 0)
			s1 = s1 + "毒攻:" + (h[1] + 1) + "级;";
		if (g[13] > 0)
			s1 = s1 + "晕攻:" + (h[2] + 1) + "级;";
		if (g[4] > 0)
			s1 = s1 + "冰抗:" + (h[3] + 1) + "级;";
		if (g[5] > 0)
			s1 = s1 + "毒抗:" + (h[4] + 1) + "级;";
		if (g[6] > 0)
			s1 = s1 + "晕抗:" + (h[5] + 1) + "级;";
		s1 = s1 + "价钱:" + a() + ";";
		s1 = s1 + "需要等级:" + c() + "级;&";
		if (g[14] == -1 && e[g[15]] == 3)
			s1 = s1 + "廉价的饰品。";
		return s1;
	}

	public final short[] a(int i1)
	{
		short aword0[] = new short[i1];
		for (int j1 = 0; j1 < 14; j1++)
		{
			short word0;
			if ((word0 = b[j1]) != -1)
				aword0[word0] = g[j1];
		}

		return aword0;
	}

	public static final n[] a(byte byte0)
	{
		if (byte0 != 1 && byte0 != 3 && byte0 != 5 && byte0 != 6)
			return null;
		Vector vector = new Vector();
		n an[];
		int j1;
		switch (byte0)
		{
		case 1: // '\001'
		case 3: // '\003'
		case 5: // '\005'
		case 6: // '\006'
			for (int i1 = 0; i1 < n[byte0].length; i1++)
			{
				n n1 = null;
				byte byte1;
				n1 = c(byte1 = n[byte0][i1]);
				vector.addElement(n1);
			}

			// fall through

		case 2: // '\002'
		case 4: // '\004'
		default:
			an = new n[vector.size()];
			j1 = 0;
			break;
		}
		for (; j1 < vector.size(); j1++)
			an[j1] = (n)vector.elementAt(j1);

		return an;
	}

	public static final byte[] b(byte byte0)
	{
		byte abyte0[] = new byte[n[byte0].length];
		System.arraycopy(n[byte0], 0, abyte0, 0, abyte0.length);
		return abyte0;
	}

	public static final n c(byte byte0)
	{
		n n1;
		(n1 = new n()).f = o[byte0];
		short aword0[] = p[byte0];
		n1.g[14] = aword0[0];
		n1.g[15] = aword0[1];
		n1.g[16] = c(n1.g[15]);
		n1.g[2] = aword0[2];
		n1.g[17] = aword0[3];
		short aword1[][] = q[byte0];
		for (int i1 = 0; i1 < aword1.length; i1++)
			if (aword1[i1].length == 4)
			{
				n1.g[aword1[i1][0]] = aword1[i1][1];
				short word0 = aword1[i1][3];
				switch (aword1[i1][0])
				{
				case 11: // '\013'
					n1.h[0] = word0;
					break;

				case 12: // '\f'
					n1.h[1] = word0;
					break;

				case 13: // '\r'
					n1.h[2] = word0;
					break;

				case 4: // '\004'
					n1.h[3] = word0;
					break;

				case 5: // '\005'
					n1.h[4] = word0;
					break;

				case 6: // '\006'
					n1.h[5] = word0;
					break;
				}
			} else
			{
				n1.g[aword1[i1][0]] = aword1[i1][1];
			}

		n1.i = r[byte0];
		return n1;
	}

	public static final void d(byte byte0)
	{
		boolean flag = false;
		boolean flag1 = false;
		boolean flag2 = false;
		int k1 = ((y) (k.s)).g[7];
		if (byte0 == 0 || byte0 == 4 || byte0 == 5)
		{
			for (int l1 = 0; l1 < u.length; l1++)
				if (l1 != 1)
				{
					short word1 = u[l1];
					short word0 = e(byte0);
					int j1 = a(byte0, (byte)l1);
					((y) (k.s)).g[word1] -= j1;
					int i1 = word0 + 1;
					((y) (k.s)).g[word1] += C[byte0][i1][l1];
				}

		}
		w[byte0][0]++;
		k.s.h((short)k1);
		k.s.i(((y) (k.s)).g[7]);
	}

	public static final short e(byte byte0)
	{
		return w[byte0][0];
	}

	public static final void f(byte byte0)
	{
		w[byte0][1] = 1;
		if (byte0 == 0 || byte0 == 4 || byte0 == 5)
		{
			int i1 = ((y) (k.s)).g[7];
			for (int j1 = 0; j1 < u.length; j1++)
				if (j1 != 1)
				{
					short word0 = u[j1];
					((y) (k.s)).g[word0] += C[byte0][0][j1];
				}

			k.s.h((short)i1);
			k.s.i(((y) (k.s)).g[7]);
		}
	}

	public static final boolean g(byte byte0)
	{
		return w[byte0][1] == 1;
	}

	public static final int h(byte byte0)
	{
		if (byte0 >= 6 || byte0 < 0)
			return 30000;
		if (g(byte0))
		{
			short word0 = e(byte0);
			return C[byte0][word0][1];
		} else
		{
			return 30000;
		}
	}

	public static final int a(byte byte0, byte byte1)
	{
		byte byte2 = (byte)e(byte0);
		return C[byte0][byte2][byte1];
	}

	public static final String b(int i1)
	{
		String s1 = v[i1] + "&";
		if (g((byte)i1))
			s1 = s1 + "[当前级别:" + (w[i1][0] + 1) + "级]";
		else
			s1 = s1 + "[尚未习得]";
		return s1;
	}

	public static final n a(int i1, Vector vector)
	{
		if (i1 < 0)
			return null;
		if (i1 < 100)
		{
			if (u.a(50))
			{
				int j1 = 0;
				byte byte0 = e[i1];
				j1 = u.b(c[byte0].length);
				return a(c[byte0][j1], i1);
			} else
			{
				return a(-1, i1);
			}
		} else
		{
			i1 -= 100;
			vector.addElement(String.valueOf(i1));
			return null;
		}
	}

	static 
	{
		String as[] = new String[4];
		as[0] = "武器";
		as[1] = "盔甲";
		as[2] = "战靴";
		as[3] = "饰品";
		byte abyte0[][] = new byte[13][];
		abyte0[0] = new byte[0];
		abyte0[1] = (new byte[] {
			0
		});
		abyte0[2] = (new byte[] {
			0
		});
		abyte0[3] = (new byte[] {
			0
		});
		abyte0[4] = (new byte[] {
			0
		});
		abyte0[5] = new byte[0];
		abyte0[6] = (new byte[] {
			1, 2
		});
		abyte0[7] = (new byte[] {
			1, 2
		});
		abyte0[8] = (new byte[] {
			1, 2
		});
		abyte0[9] = (new byte[] {
			1, 2
		});
		abyte0[10] = new byte[0];
		abyte0[11] = (new byte[] {
			3
		});
		abyte0[12] = (new byte[] {
			3
		});
		String as1[] = new String[18];
		as1[0] = "降低50%的速度,持续3秒";
		as1[1] = "降低50%的速度,持续6秒";
		as1[2] = "降低50%的速度,持续9秒";
		as1[3] = "使主角每秒中毒2点血,持续15秒";
		as1[4] = "使主角每秒中毒5点血,持续30秒";
		as1[5] = "使主角每秒中毒10点血,持续50秒";
		as1[6] = "使主角眩晕2秒";
		as1[7] = "使主角眩晕3秒";
		as1[8] = "使主角眩晕5秒";
		as1[9] = "原效果减2秒";
		as1[10] = "原效果减4秒";
		as1[11] = "原效果减6秒";
		as1[12] = "原效果减1点伤害,减8秒";
		as1[13] = "原效果减3点伤害,减15秒";
		as1[14] = "原效果减3点伤害,减15秒";
		as1[15] = "原效果减1秒";
		as1[16] = "原效果减2秒";
		as1[17] = "原效果减3秒";
	}
}

⌨️ 快捷键说明

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