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

📄 h.java

📁 J2ME连连看源码 J2ME连连看源码
💻 JAVA
字号:
// Decompiled by Jad v1.5.8g. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://www.kpdus.com/jad.html
// Decompiler options: packimports(3) 

import java.util.Vector;
import javax.microedition.lcdui.Graphics;

public class h
{

    public h(d d1, int i, int j, Vector vector)
    {
        a_d_fld = d1;
        b_int_fld = 0;
        String s = "";
        a_int_fld = vector.size();
        a_int_array1d_fld = new int[a_int_fld + 1];
        b_int_array1d_fld = new int[a_int_fld + 1];
        a_int_array1d_fld[0] = i;
        b_int_array1d_fld[0] = j;
        int k = a_int_fld - 1;
        for(int l = 0; k >= 0; l++)
        {
            String s1 = (String)vector.elementAt(k);
            if(s1.equals("N"))
            {
                a_int_array1d_fld[l + 1] = a_int_array1d_fld[l] - 1;
                b_int_array1d_fld[l + 1] = b_int_array1d_fld[l];
            } else
            if(s1.equals("S"))
            {
                a_int_array1d_fld[l + 1] = a_int_array1d_fld[l] + 1;
                b_int_array1d_fld[l + 1] = b_int_array1d_fld[l];
            } else
            if(s1.equals("E"))
            {
                a_int_array1d_fld[l + 1] = a_int_array1d_fld[l];
                b_int_array1d_fld[l + 1] = b_int_array1d_fld[l] + 1;
            } else
            if(s1.equals("W"))
            {
                a_int_array1d_fld[l + 1] = a_int_array1d_fld[l];
                b_int_array1d_fld[l + 1] = b_int_array1d_fld[l] - 1;
            }
            k--;
        }

    }

    public void a()
    {
        b_int_fld++;
        d.b.setClip(0, 0, d.av, d.aw);
        d.b.setColor(a_d_fld.e);
        for(int i = 0; i < a_int_array1d_fld.length - 1; i++)
        {
            int j = a_d_fld.l + b_int_array1d_fld[i] * 19 + a_d_fld.g;
            int k = a_d_fld.m + a_int_array1d_fld[i] * 19 + a_d_fld.h;
            int l = a_d_fld.l + b_int_array1d_fld[i + 1] * 19 + a_d_fld.g;
            int i1 = a_d_fld.m + a_int_array1d_fld[i + 1] * 19 + a_d_fld.h;
            d.b.drawLine(j, k, l, i1);
            if(b_int_array1d_fld[i] == b_int_array1d_fld[i + 1])
            {
                d.b.drawLine(j - 1, k, l - 1, i1);
                continue;
            }
            if(a_int_array1d_fld[i] == a_int_array1d_fld[i + 1])
                d.b.drawLine(j, k - 1, l, i1 - 1);
        }

    }

    public int a_int_array1d_fld[];
    public int b_int_array1d_fld[];
    public int a_int_fld;
    public int b_int_fld;
    private final d a_d_fld;
}

⌨️ 快捷键说明

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