b.java

大富翁手机游戏

                i();
            }
        }
        catch(Exception exception) { }
        RichmanTaiwanMIDlet _tmp = M;
        if(RichmanTaiwanMIDlet.l)
            g1.drawImage(af[1], 150, 138, 20);
        else
            g1.drawImage(af[0], 150, 138, 20);
        if(H == 1)
        {
            if(aa == null)
            {
                aa = new Command("返回", 2, 1);
                addCommand(aa);
                setCommandListener(this);
            }
            g1.setFont(O);
            if(B == 1)
            {
                for(byte byte0 = 0; byte0 < p.length; byte0++)
                {
                    if(k == byte0)
                        g1.setColor(0, 0, 255);
                    else
                        g1.setColor(0, 0, 0);
                    g1.fillRect(d, S[byte0], T, q);
                    g1.setColor(255, 255, 0);
                    g1.drawRect(d, S[byte0], T, q);
                    g1.setColor(255, 255, 255);
                    g1.drawString(p[byte0], (176 - O.stringWidth(p[byte0])) / 2, S[byte0], 20);
                }

            } else
            if(B == 2)
            {
                for(int l2 = 0; l2 < Y.length; l2++)
                {
                    if(x == l2)
                        g1.setColor(0, 0, 255);
                    else
                        g1.setColor(0, 0, 0);
                    g1.fillRect(d, 70 + 30 * l2, T, q);
                    g1.setColor(255, 255, 1);
                    g1.drawRect(d, 70 + 30 * l2, T, q);
                    g1.setColor(255, 255, 255);
                    g1.drawString(Y[l2], (176 - O.stringWidth(Y[l2])) / 2, 70 + 30 * l2, 20);
                }

            }
        } else
        if(aa != null)
        {
            removeCommand(aa);
            aa = null;
        }
    }

    void a(Graphics g1, int i1)
    {
        int j1 = A[i1];
        if(j1 > 2 && j1 < 6 || j1 > 8 && j1 < 14)
            g1.drawImage((Image)J.elementAt(ad[i1] * 2 + 8), (110 - w[A[l]][0]) + w[j1][0], ((90 - w[A[l]][1]) + w[j1][1]) - 2, 20);
        else
        if(j1 > 13 && j1 < 17 || j1 > 20 && j1 < 24)
            g1.drawImage((Image)J.elementAt(ad[i1] * 2 + 21), (110 - w[A[l]][0]) + w[j1][0], ((90 - w[A[l]][1]) + w[j1][1]) - 3, 20);
        else
        if(j1 > 16 && j1 < 21 || j1 > 23 && j1 < 29)
            g1.drawImage((Image)J.elementAt(ad[i1] * 2 + 9), (110 - w[A[l]][0]) + w[j1][0], ((90 - w[A[l]][1]) + w[j1][1]) - 3, 20);
        else
            g1.drawImage((Image)J.elementAt(ad[i1] * 2 + 20), (110 - w[A[l]][0]) + w[j1][0], ((90 - w[A[l]][1]) + w[j1][1]) - 2, 20);
    }

    private void a(Graphics g1, String s1)
    {
        g1.setFont(h);
        int i1 = g1.getFont().stringWidth(s1);
        g1.setColor(0, 0, 0);
        g1.fillRect(80 - (i1 / 2 + 2) - 1, 48, i1 + 6, 24);
        g1.setColor(255, 255, 255);
        g1.fillRect(80 - (i1 / 2 + 2), 49, i1 + 4, 22);
        g1.setColor(255, 128, 0);
        g1.drawString(s1, 80, 67, 65);
    }

    public void c(int i1, int j1)
    {
        b.schedule(new f(this, j1), i1);
    }

    public void a(int i1)
    {
        L = i1;
        if(V == null)
        {
            V = new Thread(this);
            V.start();
        }
    }

    public void k()
    {
        V = new Thread(this);
        V.start();
    }

    public void run()
    {
        if(H >= 2 || H == 1)
            return;
        Thread thread = Thread.currentThread();
        int i1 = 0;
        do
        {
            if(thread != V)
                break;
            try
            {
                Thread.sleep(250L);
                if(i1 == L)
                {
                    V = null;
                    if(C)
                    {
                        t();
                    } else
                    {
                        C = true;
                        N[l] += (L - 6) * 100;
                        M.b((L - 5) * 100, l != 0);
                    }
                } else
                if(i1 < 5)
                {
                    a = ++i1 != 5 ? e(5) : L - 6;
                    repaint();
                    serviceRepaints();
                } else
                if(i1 > 4)
                    if(C)
                    {
                        i1++;
                        f(i1);
                        repaint();
                        serviceRepaints();
                    } else
                    {
                        i1 = L;
                    }
            }
            catch(Exception exception) { }
        } while(true);
    }

    private void f(int i1)
    {
        A[l]++;
        if(A[l] == 30)
        {
            if(l == 0)
            {
                RichmanTaiwanMIDlet _tmp = M;
                RichmanTaiwanMIDlet.b++;
            }
            if(i1 != 6)
            {
                G = 1;
                N[l] += 900;
            }
            A[l] = 0;
        }
    }

    private void t()
    {
        switch(A[l])
        {
        case 3: // '\003'
        case 17: // '\021'
            f();
            return;

        case 9: // '\t'
        case 24: // '\030'
            d(10);
            return;

        case 14: // '\016'
            m();
            return;

        case 6: // '\006'
        case 21: // '\025'
            G = 10;
            repaint();
            serviceRepaints();
            c(1000, 0);
            return;

        case 29: // '\035'
            c(1000, 0);
            return;

        case 4: // '\004'
        case 5: // '\005'
        case 7: // '\007'
        case 8: // '\b'
        case 10: // '\n'
        case 11: // '\013'
        case 12: // '\f'
        case 13: // '\r'
        case 15: // '\017'
        case 16: // '\020'
        case 18: // '\022'
        case 19: // '\023'
        case 20: // '\024'
        case 22: // '\026'
        case 23: // '\027'
        case 25: // '\031'
        case 26: // '\032'
        case 27: // '\033'
        case 28: // '\034'
        default:
            b();
            return;
        }
    }

    private boolean l()
    {
        boolean flag = false;
        switch(ae[A[l]])
        {
        case 0: // '\0'
            flag = N[l] >= D[A[l]];
            break;

        case 1: // '\001'
        case 10: // '\n'
        case 100: // 'd'
            flag = N[l] >= (D[A[l]] * 8) / 5;
            break;

        case 2: // '\002'
        case 20: // '\024'
        case 200: 
            flag = N[l] >= (D[A[l]] * 24) / 5;
            break;

        case 3: // '\003'
        case 30: // '\036'
        case 300: 
            flag = N[l] >= D[A[l]] * 8;
            break;
        }
        return flag;
    }

    private void b()
    {
        if(ae[A[l]] <= 0)
        {
            if(l())
                s();
            else
                c(1000, 0);
        } else
        if(p())
        {
            if(N[l] >= D[A[l]])
            {
                int i1 = 1;
                for(int j1 = 0; j1 < l; j1++)
                    i1 *= 10;

                if(ae[A[l]] == 4 * i1)
                    c(1000, 0);
                else
                if(l())
                    s();
                else
                    c(1000, 0);
            } else
            {
                c(1000, 0);
            }
        } else
        if(R[o()] > 0 || E[o()] > 0)
            c(1000, 0);
        else
            b(o(), l(A[l]));
    }

    public void v()
    {
        switch(ae[A[l]])
        {
        case 0: // '\0'
            N[l] -= D[A[l]];
            break;

        case 1: // '\001'
        case 10: // '\n'
        case 100: // 'd'
            N[l] -= (D[A[l]] * 8) / 5;
            break;

        case 2: // '\002'
        case 20: // '\024'
        case 200: 
            N[l] -= (D[A[l]] * 24) / 5;
            break;

        case 3: // '\003'
        case 30: // '\036'
        case 300: 
            N[l] -= D[A[l]] * 8;
            break;
        }
        ae[A[l]] += l != 0 ? l != 1 ? 100 : 10 : 1;
    }

    private void b(int i1, int j1)
    {
        N[l] -= j1;
        N[i1] += j1;
        if(N[l] < 0)
label0:
            switch(l)
            {
            default:
                break;

            case 0: // '\0'
                for(int k1 = 0; k1 < ae.length; k1++)
                    if(ae[k1] < 10 && ae[k1] > 0)
                        ae[k1] = 0;

                break;

            case 1: // '\001'
                int l1 = 0;
                do
                {
                    if(l1 >= ae.length)
                        break label0;
                    if(ae[l1] >= 10 && ae[l1] < 100)
                        ae[l1] = 0;
                    l1++;
                } while(true);

            case 2: // '\002'
                for(int i2 = 0; i2 < ae.length; i2++)
                    if(ae[i2] >= 100)
                        ae[i2] = 0;

                break;
            }
        M.a(j1, l, ad[i1]);
    }

    int g(int i1)
    {
        switch(ae[i1])
        {
        case 1: // '\001'
        case 10: // '\n'
        case 100: // 'd'
            return (D[i1] * 4) / 5;

        case 2: // '\002'
        case 20: // '\024'
        case 200: 
            return D[i1] * 2;

        case 3: // '\003'
        case 30: // '\036'
        case 300: 
            return (D[i1] * 14) / 5;

        case 4: // '\004'
        case 40: // '('
        case 400: 
            return D[i1] * 4;
        }
        return 0;
    }

    private int o()
    {
        if(ae[A[l]] < 10)
            return 0;
        return ae[A[l]] >= 100 ? 2 : 1;
    }

    int l(int i1)
    {
        int j1 = 0;
        int k1 = i1;
        byte byte0;
        for(byte0 = ae[i1] >= 10 ? ae[i1] >= 100 ? 100 : 10 : 1; k1 != 0 && ae[k1 - 1] != 0 && ae[k1 - 1] >= byte0 && ae[k1 - 1] <= byte0 * 4; k1--)
            j1 += d(ae[k1 - 1], k1 - 1);

        for(int l1 = i1; ae[l1 + 1] != 0 && ae[l1 + 1] >= byte0 && ae[l1 + 1] <= byte0 * 4; l1++)
            j1 += d(ae[l1 + 1], l1 + 1);

        if(j1 == 0)
            j1 = g(i1);
        else
            j1 += d(ae[i1], i1);
        return j1;
    }

    int d(int i1, int j1)
    {
        switch(i1)
        {
        case 1: // '\001'
        case 10: // '\n'
        case 100: // 'd'
            return D[j1];
        }
        return 500;
    }

    private void s()
    {
        int i1 = ae[A[l]];
        int j1 = 0;
        for(int k1 = 0; k1 < 2; k1++)
            if(i1 >= 10)
                i1 /= 10;

        switch(i1)
        {
        case 0: // '\0'
            j1 = D[A[l]];
            break;

        case 1: // '\001'
            j1 = (D[A[l]] * 8) / 5;
            break;

        case 2: // '\002'
            j1 = (D[A[l]] * 24) / 5;
            break;

        case 3: // '\003'
            j1 = D[A[l]] * 8;
            break;
        }
        M.a(A[l], j1, l, i1);
    }

    private void f()
    {
        int i1 = e(7);
        String s1 = j[i1];
        switch(i1)
        {
        case 0: // '\0'
            R[l] += 2;
            A[l] = 14;
            break;

        case 1: // '\001'
            N[l] += 200;
            break;

        case 2: // '\002'
            s1 = s1 + "\n 获得美金$" + N[l] / 10;
            N[l] = (N[l] * 110) / 100;
            break;

        case 3: // '\003'
            s1 = s1 + "\n 损失美金$" + N[l] / 10;
            N[l] = (N[l] * 90) / 100;
            break;

        case 4: // '\004'
            s1 = s1 + "\n 支付美金$" + (N[l] * 5) / 100;
            N[l] = (N[l] * 95) / 100;
            break;

        case 5: // '\005'
            c(15);
            break;

        case 6: // '\006'
            w();
            break;

        case 7: // '\007'
            N[l] += 200;
            break;
        }
        if(i1 != 5 && i1 != 6)
            M.a(s1, l != 0);
    }

    private boolean a(int i1, int j1)
    {
        boolean flag = false;
        for(int k1 = 0; k1 < g[0].length; k1++)
            if(g[i1][k1] == j1)
                flag = true;

        if(!flag)
            return false;
        for(int l1 = 0; l1 < 5; l1++)
            if(g[i1][l1] == j1)
            {
                g[i1][l1] = 16;
                l1 = 5;
            }

        for(int i2 = 0; i2 < 4; i2++)
            if(g[i1][i2] == 16)
            {
                g[i1][i2] = g[i1][i2 + 1];
                g[i1][i2 + 1] = 16;
            }

        return true;
    }

    private void e(int i1, int j1)
    {
        for(int k1 = i1; k1 < j1 + 1; k1++)
        {
            if(ae[k1] >= 100)
                ae[k1] = 100;
            else
            if(ae[k1] >= 10)
                ae[k1] += 10;
            else
            if(ae[k1] > 0)
                ae[k1]++;
            m(k1);
        }

    }

    void m(int i1)
    {
        ae[i1] = ae[i1] != 5 ? ae[i1] != 50 ? ae[i1] != 500 ? ae[i1] : 400 : 40 : 4;
    }

    private void c(int i1)
    {
        switch(e(7))
        {
        case 0: // '\0'
            a(i1, 0, 2);
            break;

        case 1: // '\001'
            a(i1, 4, 5);
            break;

        case 2: // '\002'
            a(i1, 7, 8);
            break;

        case 3: // '\003'
            a(i1, 10, 13);
            break;

        case 4: // '\004'
            a(i1, 15, 16);
            break;

        case 5: // '\005'
            a(i1, 18, 20);
            break;

        case 6: // '\006'
            a(i1, 22, 23);
            break;

        case 7: // '\007'
            a(i1, 25, 28);
            break;
        }
    }

    private void a(int i1, int j1, int k1)
    {
        if(i1 == 11)
            e(j1, k1);
        else
        if(i1 == 15)
        {
            for(int l1 = j1; l1 < k1 + 1; l1++)
                ae[l1] = 0;

        } else
        {
            f(j1, k1);
        }
        int ai[] = new int[(k1 - j1) + 1];