📄 g.java
字号:
continue;
if (ah1[y].s == 2)
{
if (ah1[y].u[i14] >= 16)
{
ah3 = aJ;
T = ah1[y].u[i14] - 16;
} else
{
ah3 = aH;
T = ah1[y].u[i14];
}
} else
if (ah1[y].s == 1)
{
ah3 = aI;
T = ah1[y].u[i14];
}
if (ah3[T].p == 3 || ah3[T].p == 4 || ah3[T].e == -2 || ah3[T].e == -1 || ah3[T].q != 2)
continue;
J = (new int[] {
ah3[T].b / 20, ah3[T].c / 20
});
flag8 = true;
break;
}
if (flag8)
{
boolean flag9 = false;
int j14 = 0;
do
{
if (j14 >= ah1[y].v.length)
break;
if (ah1[y].s == 2)
{
if (ah1[y].v[j14] >= 16)
{
ah3 = aJ;
T = ah1[y].v[j14] - 16;
} else
{
ah3 = aH;
T = ah1[y].v[j14];
}
} else
if (ah1[y].s == 1)
{
ah3 = aI;
T = ah1[y].v[j14];
}
if (ah3[T].p != 3 && ah3[T].p != 4 && ah3[T].e != -2 && ah3[T].e != -1 && ah3[T].q == 2)
{
K = (new int[] {
ah3[T].b, ah3[T].c
});
ah3[T].q = 4;
flag9 = true;
break;
}
j14++;
} while (true);
if (flag9)
{
ah1[y].q = 8;
L = a(ah1[y], (byte)1);
} else
{
ah1[y].q = 9;
}
}
}
}
byte byte5 = -1;
byte byte6 = 0;
byte byte7 = 0;
byte byte8 = 0;
boolean flag24 = false;
boolean flag25 = false;
boolean flag26 = false;
int k19 = 0;
boolean flag27 = false;
boolean flag28 = false;
int ai3[] = null;
byte byte9 = 3;
if (ah1[y].q == 0)
{
for (int j20 = 0; j20 < ah1[y].x.length; j20++)
{
if (ah1[y].s == 1)
{
if (ah1[y].x[j20] >= 16)
{
ah2 = aJ;
byte7 = (byte)(ah1[y].x[j20] - 16);
} else
{
ah2 = aH;
byte7 = ah1[y].x[j20];
}
} else
if (ah1[y].s == 2)
{
ah2 = aI;
byte7 = ah1[y].x[j20];
}
if (ah2[byte7].p == 3 || ah2[byte7].p == 4 || ah2[byte7].e == -2 || ah2[byte7].e == -1)
continue;
int k16 = 0;
boolean flag29 = false;
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, c(ah1[y]), (byte)3, ah1[y].s);
if (B != null && ah2[byte7].b / 20 >= D && ah2[byte7].b / 20 < D + B[0].length && ah2[byte7].c / 20 >= E && ah2[byte7].c / 20 < E + B.length && B[ah2[byte7].c / 20 - E][ah2[byte7].b / 20 - D] != -100)
{
k16 = -a(ah2[byte7], ah1[y], a(ah1[y], new int[] {
ah2[byte7].b / 20, ah2[byte7].c / 20
}));
flag29 = true;
}
if (!flag29 && am[ak[ah1[y].a][0]][7] != -2)
{
int j8 = 0x7fffffff;
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, (byte)ah1[y].m[4], (byte)1, ah1[y].s);
byte abyte6[][] = B;
int j22 = D;
int i23 = E;
if (abyte6 != null)
{
for (int k23 = 0; k23 < abyte6.length; k23++)
{
for (int l23 = 0; l23 < abyte6[k23].length; l23++)
{
if (abyte6[k23][l23] == -100 || abyte0[k23 + i23][l23 + j22] != -1)
continue;
a(new int[] {
l23 + j22, k23 + i23
}, c(ah1[y]), (byte)3, ah1[y].s);
if (B == null || ah2[byte7].b / 20 < D || ah2[byte7].b / 20 >= D + B[0].length || ah2[byte7].c / 20 < E || ah2[byte7].c / 20 >= E + B.length || B[ah2[byte7].c / 20 - E][ah2[byte7].b / 20 - D] == -100)
continue;
k16 = -a(ah2[byte7], ah1[y], a(ah1[y], new int[] {
ah2[byte7].b / 20, ah2[byte7].c / 20
}));
if (j8 > Math.abs((l23 + j22) - ah1[y].b / 20) + Math.abs((k23 + i23) - ah1[y].c / 20))
{
j8 = Math.abs((l23 + j22) - ah1[y].b / 20) + Math.abs((k23 + i23) - ah1[y].c / 20);
ai3 = (new int[] {
l23 + j22, k23 + i23
});
}
}
}
}
}
int k17 = 0;
int j7;
if ((j7 = a(ah1[y], (byte)2)) != -1)
{
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, (byte)4, (byte)4, ah1[y].s);
if (B != null && ah2[byte7].b / 20 >= D && ah2[byte7].b / 20 < D + B[0].length && ah2[byte7].c / 20 >= E && ah2[byte7].c / 20 < E + B.length && B[ah2[byte7].c / 20 - E][ah2[byte7].b / 20 - D] != -100 && ah1[y].l >= (at[j7][0] * ah1[y].m[1]) / 100)
{
if (at[j7][2] == 0 || at[j7][2] == 9)
k17 = ah1[y].l;
else
if (at[j7][2] == 6 && ah2[byte7].n <= 0)
k17 = 0x7fffffff;
L = j7;
}
}
int k18;
if ((k18 = k17 <= k16 ? k16 : k17) <= 0)
continue;
if (ah2[byte7].k + k18 <= 0)
{
if (ah2[byte7].d != -5)
{
if (byte5 != -1 && (byte6 != 1 ? byte6 != 0 ? aJ : aH : aI)[ah1[y].s != 1 || byte5 < 16 ? byte5 : byte5 - 16].k >= ah2[byte7].k)
continue;
byte5 = ah1[y].x[j20];
byte6 = ah2[0].s;
J = ai3;
flag27 = flag29;
byte8 = 5;
if (k17 > k16)
byte9 = 4;
else
byte9 = 3;
k19 = k18;
continue;
}
if (byte8 >= 4 || byte5 != -1 && (byte6 != 1 ? byte6 != 0 ? aJ : aH : aI)[ah1[y].s != 1 || byte5 < 16 ? byte5 : byte5 - 16].k >= ah2[byte7].k)
continue;
byte5 = ah1[y].x[j20];
byte6 = ah2[0].s;
J = ai3;
flag27 = flag29;
byte8 = 4;
if (k17 > k16)
byte9 = 4;
else
byte9 = 3;
continue;
}
if (byte8 > 3 || byte5 != -1 && (byte6 != 1 ? byte6 != 0 ? aJ : aH : aI)[ah1[y].s != 1 || byte5 < 16 ? byte5 : byte5 - 16].k - k19 <= ah2[byte7].k - k18)
continue;
byte5 = ah1[y].x[j20];
byte6 = ah2[0].s;
J = ai3;
flag27 = flag29;
byte8 = 3;
k19 = k18;
if (k17 > k16)
byte9 = 4;
else
byte9 = 3;
}
if (byte5 != -1)
{
if (ah1[y].s == 1)
{
if (byte5 >= 16)
{
ah2 = aJ;
byte7 = (byte)(byte5 - 16);
} else
{
ah2 = aH;
byte7 = byte5;
}
} else
if (ah1[y].s == 2)
{
ah2 = aI;
byte7 = byte5;
}
K = (new int[] {
ah2[byte7].b, ah2[byte7].c
});
ah1[y].q = byte9 != 4 ? ((byte)(flag27 ? 11 : 10)) : 12;
}
}
if (ah1[y].q == 0 || ah1[y].q == 1)
{
ah1[y].q = 0;
boolean flag10 = false;
L = -1;
int k7;
if (ah1[y].l == ah1[y].m[1] && ah1[y].o == 0 && (k7 = a(ah1[y], (byte)4)) != -1)
{
L = k7;
K = (new int[] {
ah1[y].b, ah1[y].c
});
flag10 = true;
}
if (flag10)
ah1[y].q = 13;
}
if (ah1[y].q == 0)
{
boolean flag11 = false;
if (ah1[y].h >= 0 && ah1[y].i >= 0)
{
if (ah1[y].s == 1)
ah2 = aH;
else
if (ah1[y].s == 2)
ah2 = aI;
if (ah1[y].k != ah1[y].m[0] && ah1[y].k + a(ah1[y], ah2[0], a(ah2[0], new int[] {
ah1[y].b / 20, ah1[y].c / 20
})) <= 0)
flag11 = true;
} else
{
flag11 = false;
for (int k20 = 0; k20 < ah1[y].w.length; k20++)
{
if (ah1[y].w[k20] == -1)
continue;
if (ah1[y].s == 1)
{
if (ah1[y].w[k20] >= 16)
{
ah2 = aJ;
byte7 = (byte)(ah1[y].w[k20] - 16);
} else
{
ah2 = aH;
byte7 = ah1[y].w[k20];
}
} else
if (ah1[y].s == 2)
{
ah2 = aI;
byte7 = ah1[y].w[k20];
}
if (ah2[byte7].p == 3 || ah2[byte7].p == 4 || ah2[byte7].e == -2 || ah2[byte7].e == -1)
continue;
flag11 = true;
break;
}
}
if (flag11)
{
boolean flag12 = false;
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, (byte)ah1[y].m[4], (byte)1, ah1[y].s);
if (B != null)
{
int l20 = 0;
do
{
if (l20 >= B.length)
break;
int k21 = 0;
do
{
if (k21 >= B[l20].length)
break;
if (B[l20][k21] != -100 && abyte0[l20 + E][k21 + D] < 0 && abyte1[l20 + E][k21 + D] < 0 && (aE[l20 + E][k21 + D] == 10 || aE[l20 + E][k21 + D] == 11))
{
J = (new int[] {
k21 + D, l20 + E
});
flag12 = true;
break;
}
k21++;
} while (true);
if (flag12)
break;
l20++;
} while (true);
}
if (flag12)
ah1[y].q = 9;
}
}
if (ah1[y].q == 0)
if (ah1[y].h >= 0 && ah1[y].i >= 0)
{
if (ah1[y].g <= x)
{
J = (new int[] {
ah1[y].h, ah1[y].i
});
ah1[y].q = 9;
}
} else
{
boolean flag13 = false;
for (int i21 = 0; i21 < ah1[y].w.length; i21++)
{
if (ah1[y].w[i21] == -1)
continue;
if (ah1[y].s == 1)
{
if (ah1[y].w[i21] >= 16)
{
ah2 = aJ;
byte7 = (byte)(ah1[y].w[i21] - 16);
} else
{
ah2 = aH;
byte7 = ah1[y].w[i21];
}
} else
if (ah1[y].s == 2)
{
ah2 = aI;
byte7 = ah1[y].w[i21];
}
if (ah2[byte7].p == 3 || ah2[byte7].p == 4 || ah2[byte7].e == -2 || ah2[byte7].e == -1)
continue;
flag13 = true;
break;
}
if (flag13)
{
ah1[y].q = 9;
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, (byte)ah1[y].m[4], (byte)1, ah1[y].s);
if (B != null)
{
for (int l21 = 0; l21 < B.length; l21++)
{
for (int k22 = 0; k22 < B[l21].length; k22++)
{
if (abyte0[l21 + E][k22 + D] != -1 || B[l21][k22] == -100)
continue;
for (int j23 = 0; j23 < ah1[y].w.length; j23++)
{
if (ah1[y].w[j23] == -1)
continue;
if (ah1[y].s == 1)
{
if (ah1[y].w[j23] >= 16)
{
ah2 = aJ;
T = ah1[y].w[j23] - 16;
} else
{
ah2 = aH;
T = ah1[y].w[j23];
}
} else
if (ah1[y].s == 2)
{
ah2 = aI;
T = ah1[y].w[j23];
}
int j21;
if (ah2[T].p != 3 && ah2[T].p != 4 && ah2[T].e != -2 && ah2[T].e != -1 && (j21 = 100 - a(ah2[0], new int[] {
k22 + D, l21 + E
}) - (Math.abs(ah2[T].b / 20 - (k22 + D)) + Math.abs(ah2[T].c / 20 - (l21 + E)))) > l11)
{
l11 = j21;
ai2 = (new int[] {
k22 + D, l21 + E
});
}
}
}
}
if (ai2 != null)
J = ai2;
else
ah1[y].q = 4;
}
}
}
if (ah1[y].q == 0 || ah1[y].q == 3)
ah1[y].q = 4;
int ai4[] = J;
if (ah1[y].q == 9)
{
boolean flag14 = false;
if (J != null)
{
a(new int[] {
ah1[y].b / 20, ah1[y].c / 20
}, (byte)ah1[y].m[4], (byte)1, ah1[y].s);
if (B != null)
{
int k8 = Math.abs(ai4[0] - ah1[y].b / 20) + Math.abs(ai4[1] - ah1[y].c / 20);
for (int i22 = 0; i22 < B.length; i22++)
{
for (int l22 = 0; l22 < B[i22].length; l22++)
if (B[i22][l22] != -100 && abyte0[i22 + E][l22 + D] < 0 && abyte1[i22 + E][l22 + D] == -1 && Math.abs(ai4[0] - (l22 + D)) + Math.abs(ai4[1] - (i22 + E)) < k8)
{
k8 = Math.abs(ai4[0] - (l22 + D)) + Math.abs(ai4[1] - (i22 + E));
J = (new int[] {
l22 + D, i22 + E
});
flag14 = true;
}
}
if (!flag14)
ah1[y].q = 4;
}
}
}
}
Q = g;
} else
if (g % 2 == 0)
if (ah1[y].p == 2 || ah1[y].p == 4 || ah1[y].p == 3 || ah1[y].q == 2 || ah1[y].e == -2 || ah1[y].e == -1)
{
Q = -1;
y++;
if (y == ah1.length)
{
y = 0;
U = 0;
if (O == 12)
O = 13;
else
if (O == 9)
O = 10;
}
} else
{
switch (j)
{
case 1: // '\001'
case 2: // '\002'
case 3: // '\003'
case 5: // '\005'
case 8: // '\b'
case 9: // '\t'
case 10: // '\n'
default:
break;
case 0: // '\0'
if (ah1[y].q != 2)
{
a((byte)0);
switch (ah1[y].q)
{
case 4: // '\004'
byte0 = 3;
break;
case 5: // '\005'
case 7: // '\007'
case 8: // '\b'
case 12: // '\f'
case 13: // '\r'
byte0 = 2;
break;
case 6: // '\006'
case 9: // '\t'
case 10: // '\n'
byte0 = 0;
break;
case 11: // '\013'
byte0 = 1;
break;
}
}
int l8 = 0;
do
{
if (l8 >= p.length)
break;
if (p[l8] == byte0)
{
l = (byte)l8;
break;
}
l8++;
} while (true);
a((byte)1);
if (byte0 != 2)
break;
if (Y != null)
{
int i9 = 0;
do
{
if (i9 >= Y.length)
break;
if (L == Y[i9])
{
T = i9;
break;
}
i9++;
} while (true);
}
a((byte)5);
break;
case 6: // '\006'
switch (ah1[y].q)
{
case 4: // '\004'
case 6: // '\006'
case 9: // '\t'
byte0 = 3;
break;
case 10: // '\n'
byte0 = 1;
break;
}
int j9 = 0;
do
{
if (j9 >= p.length)
break;
if (p[j9] == byte0)
{
l = (byte)j9;
break;
}
j9++;
} while (true);
a((byte)1);
break;
case 4: // '\004'
a(new int[] {
J[0] * 20, J[1] * 20
});
a((byte)2);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -