al.java

来自「很好的3款手机游戏源码」· Java 代码 · 共 3,531 行 · 第 1/4 页

// 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.Image;

public class al
{

	p a;

	public al(p p1)
	{
		a = p1;
	}

	boolean do(int i)
	{
		int j = null(i);
		return j == 2 || j == 6 || j == 4 || j == 8 || j == 12 || j == 10;
	}

	boolean int(int i)
	{
		int j = null(i);
		return j == 0 || j == 14;
	}

	int null(int i)
	{
		int j = i / 10;
		if (j >= 0 && j < 2)
			j = 0;
		if (j >= 2 && j < 4)
			j = 2;
		if (j >= 4 && j < 6)
			j = 4;
		if (j >= 6 && j < 8)
			j = 6;
		if (j >= 8 && j < 10)
			j = 8;
		if (j >= 10 && j < 12)
			j = 10;
		if (j >= 12 && j < 14)
			j = 12;
		if (j >= 14 && j < 20)
			j = 14;
		if (j >= 20 && j < 50)
			j = 20;
		return j;
	}

	int[] b(int i)
	{
		int ai[] = new int[7];
		for (int j = 0; j < ai.length; j++)
			ai[j] = 0;

		switch (i)
		{
		case 20: // '\024'
			ai[1] = 2;
			break;

		case 21: // '\025'
			ai[1] = 4;
			break;

		case 22: // '\026'
			ai[1] = 7;
			break;

		case 23: // '\027'
			ai[1] = 11;
			break;

		case 24: // '\030'
			ai[1] = 13;
			ai[2] = 1;
			break;

		case 25: // '\031'
			ai[1] = 14;
			ai[2] = 3;
			break;

		case 26: // '\032'
			ai[1] = 20;
			ai[2] = 1;
			break;

		case 27: // '\033'
			ai[1] = 25;
			ai[2] = 3;
			break;

		case 40: // '('
			ai[2] = 3;
			break;

		case 41: // ')'
			ai[2] = 6;
			break;

		case 42: // '*'
			ai[2] = 10;
			break;

		case 43: // '+'
			ai[2] = 13;
			break;

		case 44: // ','
			ai[2] = 15;
			break;

		case 45: // '-'
			ai[2] = 20;
			break;

		case 46: // '.'
			ai[2] = 24;
			break;

		case 47: // '/'
			ai[2] = 30;
			break;

		case 60: // '<'
			ai[2] = 1;
			break;

		case 61: // '='
			ai[2] = 2;
			break;

		case 62: // '>'
			ai[2] = 4;
			break;

		case 63: // '?'
			ai[2] = 6;
			break;

		case 64: // '@'
			ai[2] = 10;
			break;

		case 65: // 'A'
			ai[2] = 14;
			ai[1] = 3;
			break;

		case 66: // 'B'
			ai[2] = 20;
			ai[1] = 4;
			break;

		case 80: // 'P'
			ai[3] = 1;
			break;

		case 81: // 'Q'
			ai[3] = 3;
			break;

		case 82: // 'R'
			ai[3] = 6;
			break;

		case 83: // 'S'
			ai[3] = 8;
			break;

		case 84: // 'T'
			ai[3] = 10;
			break;

		case 85: // 'U'
			ai[3] = 14;
			break;

		case 86: // 'V'
			ai[3] = 17;
			ai[2] = 2;
			// fall through

		case 87: // 'W'
			ai[3] = 19;
			ai[2] = 4;
			break;

		case 100: // 'd'
			ai[0] = 10;
			break;

		case 101: // 'e'
			ai[1] = 2;
			break;

		case 102: // 'f'
			ai[3] = 4;
			break;

		case 103: // 'g'
			ai[1] = 4;
			break;

		case 104: // 'h'
			ai[2] = 4;
			break;

		case 105: // 'i'
			ai[0] = 50;
			ai[4] = 3;
			break;

		case 106: // 'j'
			ai[1] = 10;
			ai[2] = -5;
			break;

		case 107: // 'k'
			ai[1] = 5;
			ai[3] = 5;
			ai[2] = 5;
			break;

		case 108: // 'l'
			ai[0] = 100;
			ai[2] = 10;
			break;

		case 120: // 'x'
			ai[1] = 1;
			break;

		case 121: // 'y'
			ai[2] = 2;
			break;

		case 122: // 'z'
			ai[4] = 5;
			break;

		case 123: // '{'
			ai[5] = 5;
			break;

		case 124: // '|'
			ai[6] = 5;
			break;

		case 125: // '}'
			ai[1] = 5;
			ai[4] = 2;
			break;

		case 126: // '~'
			ai[4] = 3;
			ai[5] = 3;
			ai[6] = 3;
			break;

		case 127: // '\177'
			ai[3] = 2;
			ai[1] = 3;
			ai[2] = 5;
			ai[0] = 30;
			break;

		case 128: 
			ai[1] = 10;
			break;

		case 129: 
			ai[2] = 10;
			break;

		case 130: 
			ai[1] = 10;
			ai[0] = 50;
			ai[2] = 10;
			break;
		}
		return ai;
	}

	int byte(int i)
	{
		switch (i)
		{
		case 0: // '\0'
			return 0;

		case 1: // '\001'
			return 1;

		case 2: // '\002'
			return 2;

		case 3: // '\003'
			return 3;

		case 4: // '\004'
			return 4;

		case 5: // '\005'
			return 5;

		case 20: // '\024'
			return 0;

		case 21: // '\025'
			return 1;

		case 22: // '\026'
			return 2;

		case 23: // '\027'
			return 3;

		case 24: // '\030'
			return 4;

		case 25: // '\031'
			return 5;

		case 26: // '\032'
			return 6;

		case 27: // '\033'
			return 7;

		case 40: // '('
			return 0;

		case 41: // ')'
			return 1;

		case 42: // '*'
			return 2;

		case 43: // '+'
			return 3;

		case 44: // ','
			return 4;

		case 45: // '-'
			return 5;

		case 46: // '.'
			return 6;

		case 47: // '/'
			return 7;

		case 60: // '<'
			return 0;

		case 61: // '='
			return 1;

		case 62: // '>'
			return 2;

		case 63: // '?'
			return 3;

		case 64: // '@'
			return 4;

		case 65: // 'A'
			return 5;

		case 66: // 'B'
			return 6;

		case 80: // 'P'
			return 0;

		case 81: // 'Q'
			return 1;

		case 82: // 'R'
			return 2;

		case 83: // 'S'
			return 3;

		case 84: // 'T'
			return 4;

		case 85: // 'U'
			return 5;

		case 86: // 'V'
			return 6;

		case 87: // 'W'
			return 7;

		case 100: // 'd'
			return 0;

		case 101: // 'e'
			return 1;

		case 102: // 'f'
			return 2;

		case 103: // 'g'
			return 2;

		case 104: // 'h'
			return 2;

		case 105: // 'i'
			return 3;

		case 106: // 'j'
			return 4;

		case 107: // 'k'
			return 5;

		case 108: // 'l'
			return 6;

		case 120: // 'x'
			return 0;

		case 121: // 'y'
			return 1;

		case 122: // 'z'
			return 2;

		case 123: // '{'
			return 2;

		case 124: // '|'
			return 2;

		case 125: // '}'
			return 3;

		case 126: // '~'
			return 4;

		case 127: // '\177'
			return 4;

		case 128: 
			return 3;

		case 129: 
			return 5;

		case 130: 
			return 6;

		case 140: 
			return 0;

		case 141: 
			return 2;

		case 142: 
			return 4;

		case 143: 
			return 6;

		case 144: 
			return 8;

		case 145: 
			return 10;

		case 146: 
			return 12;

		case 147: 
			return 14;

		case 148: 
			return 16;

		case 149: 
			return 1;

		case 150: 
			return 3;

		case 151: 
			return 5;

		case 152: 
			return 7;

		case 153: 
			return 9;

		case 154: 
			return 11;

		case 155: 
			return 13;

		case 156: 
			return 15;

		case 157: 
			return 17;

		case 158: 
			return 18;

		case 159: 
			return 19;

		case 160: 
			return 24;

		case 161: 
			return 29;

		case 162: 
			return 27;

		case 163: 
			return 28;

		case 200: 
			return 16;

		case 201: 
			return 17;

		case 202: 
			return 18;

		case 203: 
			return 6;

		case 204: 
			return 2;

		case 205: 
			return 14;

		case 206: 
			return 4;

		case 207: 
			return 7;

		case 208: 
			return 12;

		case 209: 
			return 11;

		case 210: 
			return 13;

		case 211: 
			return 3;

		case 212: 
			return 1;

		case 213: 
			return 5;

		case 214: 
			return 9;

		case 215: 
			return 0;

		case 216: 
			return 8;

		case 217: 
			return 26;

		case 218: 
			return 24;

		case 219: 
			return 23;

		case 220: 
			return 22;

		case 221: 
			return 25;

		case 222: 
			return 27;

		case 223: 
			return 28;

		case 224: 
			return 19;

		case 225: 
			return 20;

		case 226: 
			return 15;

		case 227: 
			return 21;

		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 28: // '\034'
		case 29: // '\035'
		case 30: // '\036'
		case 31: // '\037'
		case 32: // ' '
		case 33: // '!'
		case 34: // '"'
		case 35: // '#'
		case 36: // '$'
		case 37: // '%'
		case 38: // '&'
		case 39: // '\''
		case 48: // '0'
		case 49: // '1'
		case 50: // '2'
		case 51: // '3'
		case 52: // '4'
		case 53: // '5'
		case 54: // '6'
		case 55: // '7'
		case 56: // '8'
		case 57: // '9'
		case 58: // ':'
		case 59: // ';'
		case 67: // 'C'
		case 68: // 'D'
		case 69: // 'E'
		case 70: // 'F'
		case 71: // 'G'
		case 72: // 'H'
		case 73: // 'I'
		case 74: // 'J'
		case 75: // 'K'
		case 76: // 'L'
		case 77: // 'M'
		case 78: // 'N'
		case 79: // 'O'
		case 88: // 'X'
		case 89: // 'Y'
		case 90: // 'Z'
		case 91: // '['
		case 92: // '\\'
		case 93: // ']'
		case 94: // '^'
		case 95: // '_'
		case 96: // '`'
		case 97: // 'a'
		case 98: // 'b'
		case 99: // 'c'
		case 109: // 'm'
		case 110: // 'n'
		case 111: // 'o'
		case 112: // 'p'
		case 113: // 'q'
		case 114: // 'r'
		case 115: // 's'
		case 116: // 't'
		case 117: // 'u'
		case 118: // 'v'
		case 119: // 'w'
		case 131: 
		case 132: 
		case 133: 
		case 134: 
		case 135: 
		case 136: 
		case 137: 
		case 138: 
		case 139: 
		case 164: 
		case 165: 
		case 166: 
		case 167: 
		case 168: 
		case 169: 
		case 170: 
		case 171: 
		case 172: 
		case 173: 
		case 174: 
		case 175: 
		case 176: 
		case 177: 
		case 178: 
		case 179: 
		case 180: 
		case 181: 
		case 182: 
		case 183: 
		case 184: 
		case 185: 
		case 186: 
		case 187: 
		case 188: 
		case 189: 
		case 190: 
		case 191: 
		case 192: 
		case 193: 
		case 194: 
		case 195: 
		case 196: 
		case 197: 
		case 198: 
		case 199: 
		default:
			return 0;
		}
	}

	String else(int i)
	{
		switch (i)
		{
		case 1: // '\001'
			return "魔力";

		case 2: // '\002'
			return "防御";

		case 3: // '\003'
			return "敏捷";

		case 4: // '\004'
			return "火威力";

		case 6: // '\006'
			return "雷威力";

		case 5: // '\005'
			return "冰威力";
		}
		return "";
	}

	String goto(int i)
	{
		String s = "";
		int j = null(i);
		if (j == 2 || j == 6 || j == 4 || j == 8 || j == 12 || j == 10)
		{
			int ai[] = b(i);
			int k = 0;
			boolean flag = false;
			if (ai[1] != 0)
			{
				k++;
				int l = ai[1];
				s = s + "<r>" + else(1) + "</><y>" + (l <= 0 ? "-" : "+") + Math.abs(l) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (ai[2] != 0)
			{
				k++;
				int i1 = ai[2];
				s = s + "<r>" + else(2) + "</><y>" + (i1 <= 0 ? "-" : "+") + Math.abs(i1) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (ai[3] != 0)
			{
				k++;
				int j1 = ai[3];
				s = s + "<r>" + else(3) + "</><y>" + (j1 <= 0 ? "-" : "+") + Math.abs(j1) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (ai[4] != 0)
			{
				k++;
				int k1 = ai[4];
				s = s + "<r>" + else(4) + "</><y>" + (k1 <= 0 ? "-" : "+") + Math.abs(k1) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (ai[5] != 0)
			{
				k++;
				int l1 = ai[5];
				s = s + "<r>" + else(5) + "</><y>" + (l1 <= 0 ? "-" : "+") + Math.abs(l1) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (ai[6] != 0)
			{
				k++;
				int i2 = ai[6];
				s = s + "<r>" + else(6) + "</><y>" + (i2 <= 0 ? "-" : "+") + Math.abs(i2) + "</>";
				if (k % 2 == 0)
					s = s + "&";
				else
					s = s + " ";
			}
			if (k % 2 == 0)
				s = s + new(i);
			else
				s = s + "&" + new(i);
			ai = null;
		} else
		{
			s = new(i);
		}
		return s;
	}

	int for(int i)
	{
		switch (i)
		{
		case 0: // '\0'
			return 0;

		case 1: // '\001'
			return 1;

		case 2: // '\002'
			return 2;

		case 3: // '\003'
		case 4: // '\004'
		case 5: // '\005'
			return 2;

		case 20: // '\024'
			return 0;

		case 21: // '\025'
			return 0;

		case 22: // '\026'
			return 1;

		case 23: // '\027'
			return 1;

		case 24: // '\030'
			return 1;

		case 25: // '\031'