a.java

魂斗罗游戏的原码(j2me) 是学习j2me很好的方法

                a(4, 1, 196, 70, 4);
                a(5, 2, 230, 126, 7);
                break;
            }
            if(a == 2)
            {
                a(4, 1, 168, 98, 4);
                a(5, 1, 224, 70, 5);
                a(6, 4, 100, 14, 19);
                a(7, 4, 212, 154, 19);
            }
            break;

        case 5: // '\005'
            if(a == 0)
            {
                a(4, 1, 212, 70, 3);
                break;
            }
            if(a == 1)
            {
                d(40);
                a(4, 3, 196, 70, 6);
                a(5, 2, 230, 98, 7);
                a(6, 3, 112, 70, 17);
                break;
            }
            if(a == 2)
            {
                d(20);
                a(4, 1, 168, 98, 4);
                a(5, 1, 224, 154, 3);
                a(6, 4, 100, 154, 19);
            }
            break;

        case 6: // '\006'
            if(a == 0)
            {
                a(4, 1, 230, 154, 3);
                break;
            }
            if(a == 1)
            {
                a(4, 3, 112, 70, 6);
                a(5, 1, 224, 98, 3);
                a(6, 1, 140, 126, 3);
                break;
            }
            if(a == 2)
            {
                a(7, 1, 168, 126, 3);
                a(5, 4, 100, 32, 19);
                a(6, 4, 156, 32, 19);
                a(4, 2, 240, 154, 7);
            }
            break;

        case 7: // '\007'
            H[7].h = a("ls" + a);
            if(a == 0)
            {
                a(4, 1, 207, 54, 4);
                a(7, 9, 227, 100, 17);
                H[7].D = 10;
                a(5, 8, 200, 98, 15);
                H[5].w = H[5].i() % 10;
                a(6, 8, 218, 98, 15);
                H[6].w = H[6].i() % 10;
                break;
            }
            if(a == 1)
            {
                a(7, 5, 272, 100, 20);
                H[7].D = 35;
                break;
            }
            if(a == 2)
            {
                a(7, 6, 264, 8, 20);
                H[7].D = 15;
            }
            break;
        }
    }

    public boolean a(i i1)
    {
        int j1 = 0;
        int k1 = 0;
        int l1 = 0;
        if(i1.m() == 1)
        {
            l1 = i1.c(i1.d() + i1.h());
            j1 = (i1.d() + i1.h()) - A[l1];
            k1 = i1.f() + 16;
        } else
        if(i1.m() == 0)
        {
            int i2 = i1.d();
            l1 = i1.c(i2);
            j1 = i1.d() - A[l1];
            k1 = i1.f() + 16;
        }
        if(k1 / 28 > 6 || j1 / 28 > 10)
            return false;
        return s[G[l1]][k1 / 28][j1 / 28] < C[a];
    }

    public boolean c()
    {
        if(G[1] >= s[0].length - 1 && G[0] >= s[0].length - 1)
        {
            if(!i)
            {
                j = true;
                for(int i1 = 0; i1 <= 3; i1++)
                    if(H[i1].e())
                    {
                        H[i1].i = false;
                        H[i1].x = false;
                    } else
                    {
                        H[i1].a();
                    }

            }
            return true;
        } else
        {
            return false;
        }
    }

    public boolean c(i i1)
    {
        if(t.m() == 0)
        {
            if(i || c())
                return false;
            if(t.d() < 80)
                return false;
            if(z.i && z.d == 1)
                z.h -= 3;
            for(int j1 = 0; j1 < 2; j1++)
            {
                A[j1] -= 3;
                if(A[j1] <= -298)
                {
                    f(j1);
                    b(G[j1]);
                    A[j1] = 260;
                }
            }

            for(int k1 = 7; k1 >= 0; k1--)
                if(H[k1].i && (H[k1].r != 0 || H[k1].r == 0 && !H[k1].e()))
                    H[k1].a(H[k1].d() - 3);

            for(int l1 = 0; l1 < u.length; l1++)
                if(u[l1].i)
                    u[l1].h = u[l1].h - 3;

            for(int i2 = 0; i2 < y.length; i2++)
                if(y[i2].i)
                    y[i2].h = y[i2].h - 3;

        }
        return false;
    }

    public boolean b(i i1)
    {
        int j1 = 0;
        boolean flag = false;
        boolean flag1 = false;
        j1 = i1.d() + 4;
        for(int i2 = 0; i2 < 3; i2++)
        {
            int j2 = j1 + (i1.h() / 4) * i2;
            int k2 = i1.c(j2);
            int k1 = j2 - A[k2];
            int l1 = i1.f() + (i1.x ? 0 : 16);
            if(l1 / 28 > 6 || k1 / 28 > 10)
                return false;
            if(l1 % 28 == 0 && s[G[k2]][l1 / 28][k1 / 28] < C[a])
                return true;
        }

        return false;
    }

    public synchronized void i()
    {
        if(l)
            return;
        switch(B)
        {
        case 0: // '\0'
        case 1: // '\001'
        case 2: // '\002'
        case 3: // '\003'
        default:
            return;
        }
    }

    public void a(int i1, int j1, int k1, int l1, int i2, int j2)
    {
        int k2 = 0;
        for(k2 = 0; k2 < u.length && u[k2].i; k2++);
        if(k2 >= u.length)
            k2 = 0;
        a(u[k2], i1, j1, k1, l1, i2);
        if(j2 == 1)
            u[k2].c = l1 * (t.i() % ((a + 1) * 5) + 5);
    }

    protected void a(f f1, int i1, int j1, int k1, int l1, int i2)
    {
        f1.i = true;
        f1.h = i1;
        f1.f = j1;
        f1.b = k1;
        f1.e = l1;
        f1.d = i2;
    }

    public void f()
    {
        if(j)
            return;
        boolean flag = false;
        byte byte0 = 1;
        byte0 = t.s != 1 ? 5 : 1;
        for(int i1 = 0; i1 < byte0; i1++)
        {
            int j1 = 0;
            int k1 = 0;
            k1 = i1 % 2 != 0 ? -(i1 + 1) / 2 : (i1 + 1) / 2;
            for(j1 = 0; j1 < y.length && y[j1].i; j1++);
            if(j1 >= y.length)
                j1 = 0;
            int l1 = t.s < 2 ? t.s - 1 : 1;
            if(t.e && t.j)
                a(y[j1], t.d() + t.h() / 2, t.f(), 0 + k1, 10, l1);
            else
            if(t.a)
                a(y[j1], (t.d() + t.h()) - 10, t.f() - 6, 10, 0 + k1, l1);
            else
            if(t.l)
                a(y[j1], t.d() + 6, t.f() - 6, -10, 0 + k1, l1);
            else
            if(t.A)
                a(y[j1], t.d() + t.h() / 2, t.f() - 25, 0 + k1, -10, l1);
            else
            if(t.j)
            {
                if(t.m() == 0)
                    a(y[j1], (t.d() + t.h()) - 10, t.f() + 10, 10, 0 + k1, l1);
                else
                    a(y[j1], t.d() + 6, t.f() + 10, -10, 0 + k1, l1);
            } else
            if(t.q)
                a(y[j1], t.d(), t.f() - 15, -10 - k1, -10 + k1, l1);
            else
            if(t.F)
                a(y[j1], t.d(), t.f() + 8, -10 + k1, 10 + k1, l1);
            else
            if(t.p)
                a(y[j1], (t.d() + t.h()) - 4, t.f() - 15, 10 + k1, -10 + k1, l1);
            else
            if(t.n)
                a(y[j1], (t.d() + t.h()) - 4, t.f() + 8, 10 - k1, 10 + k1, l1);
            else
            if(t.m() == 0)
                a(y[j1], (t.d() + t.h()) - 10, t.f() - 6, 10, 0 + k1, l1);
            else
                a(y[j1], t.d() + 6, t.f() - 6, -10, 0 + k1, l1);
        }

    }

    public synchronized void a(int i1)
    {
        if(B != 3)
            return;
        if(t.x)
            return;
        switch(i1)
        {
        default:
            break;

        case -1: 
        case 50: // '2'
            if(!t.h && !t.j)
                t.A = true;
            break;

        case -2: 
        case 56: // '8'
            if(!t.h)
            {
                t.j = true;
                t.l = false;
                t.a = false;
                t.A = false;
            }
            break;

        case -3: 
        case 52: // '4'
            if(!t.j)
                t.l = true;
            break;

        case -4: 
        case 54: // '6'
            if(!t.j)
                t.a = true;
            break;

        case 48: // '0'
            if(!m && !t.h)
                f();
            break;

        case 35: // '#'
            if(!t.e && b(t) && !t.h)
            {
                t.d = 4;
                t.f(10);
                t.e = true;
            }
            break;

        case 49: // '1'
            if(!t.h)
                t.q = true;
            break;

        case 51: // '3'
            if(!t.h)
                t.p = true;
            break;

        case 55: // '7'
            if(!t.h)
                t.F = true;
            break;

        case 57: // '9'
            if(!t.h)
                t.n = true;
            break;
        }
    }

    protected synchronized void c(int i1)
    {
        switch(i1)
        {
        case -1: 
        case 50: // '2'
            t.A = false;
            break;

        case -2: 
        case 56: // '8'
            t.j = false;
            break;

        case -3: 
        case 52: // '4'
            t.l = false;
            break;

        case -4: 
        case 54: // '6'
            t.a = false;
            break;

        case 49: // '1'
            t.q = false;
            break;

        case 51: // '3'
            t.p = false;
            break;

        case 55: // '7'
            t.F = false;
            break;

        case 57: // '9'
            t.n = false;
            break;
        }
    }

    protected void a(Graphics g1, Image image, int i1, int j1, int k1, int l1)
    {
        int i2 = l1;
        int j2 = l1;
        int k2 = (i1 % 10) * i2;
        int l2 = (i1 / 10) * j2;
        a(g1, image, j1, k1, k2, l2, i2, j2, 20);
    }

    public void a(Graphics g1, Image image, int i1, int j1, int k1, int l1, int i2, 
            int j2, int k2)
    {
        g1.setClip(i1, j1, i2, j2);
        g1.drawImage(image, i1 - k1, j1 - l1, k2);
        g1.setClip(0, 0, 280, 188);
    }

    public Image a(String s1)
    {
        Image image = null;
        try
        {
            image = Image.createImage("/icons/" + s1 + ".png");
        }
        catch(Exception exception) { }
        return image;
    }

    public void e(int i1)
    {
        try
        {
            p.realize();
            p.setLoopCount(-1);
            p.start();
        }
        catch(Exception exception) { }
    }

    public void a()
    {
        try
        {
            if(p != null)
                p.stop();
        }
        catch(Exception exception) { }
    }

    public boolean e()
    {
        boolean flag = false;
        boolean flag1 = false;
        int k1 = z.h + 6;
        for(int l1 = 0; l1 < 2; l1++)
        {
            int i2 = k1 + 5 * l1;
            int j2 = t.c(i2);
            int i1 = i2 - A[j2];
            int j1 = z.f + 16;
            if(j1 / 28 > 6 || i1 / 28 > 10)
                return true;
            if(j1 % 28 == 0 && s[G[j2]][j1 / 28][i1 / 28] < C[a])
                return false;
        }

        return true;
    }

// Unreferenced inner classes:

/* anonymous class */
    class f
    {

        int d;
        int h;
        int f;
        int b;
        int e;
        boolean i;
        int c;
        int a;
        private final a g;

        public void a()
        {
            d = 0;
            h = -10;
            f = -10;
            b = 0;
            e = 0;
            c = 0;
            a = 0;
            i = false;
        }

            public 
            {
                g = a.this;
                c = 0;
                a = 0;
            }
    }

}