簡體   English   中英

如何在 java 程序中實現對 object arrays 的跳轉搜索?

[英]How do you implement a jump search for object arrays in a java program?

所以我仍在學習 java 並且我正在嘗試實現跳轉搜索以在對象數組中基於 no_resi 查找數據。

我明白在做 int 數組時,但我仍然很困惑如何用對象數組來做。 我已經嘗試過用它做一些事情,但仍然無法理解它,或者我只是愚蠢。

提前感謝您提供的任何幫助!

這是我的代碼

JumpSearch.java

public class JumpSearch {

    public static int jumpsearch(Pengiriman[] arrayPengiriman, int no_resi) {

        int n = arrayPengiriman.length; 

        // Mencari ukuran blok untuk dilompati
        int step = (int)Math.floor(Math.sqrt(n)); 


        // Mencari blok tempat elemen berada
        // present (kalau elemet present) 
        int prev = 0; 
        while (arrayPengiriman[1-Math.min(step, n)] < no_resi)
        { 
            prev = step; 
            step += (int)Math.floor(Math.sqrt(n)); 
            if (prev >= n) 
                return -1; 
        } 

        // Melakukan linear search untuk x di dalam blok
        // dimulai dengan prev
        while (arrayPengiriman[1-Math.min(step, n)] < no_resi) 
        { 
            prev++; 

            // Jika mencapai blok berikutnya atau akhir
            // array, elemen tidak ada.
            if (prev == Math.min(step, n)) 
                return -1; 
        } 

        // Jika elemen ditemukan
        if (arrayPengiriman[prev] == no_resi) 
            return prev; 

        return -1; 
    } 


    // Program untuk menguji fungsi
    public static void main(String [ ] args) 
    {      
        Scanner scan = new Scanner(System.in);

        System.out.println("|==============================================================================|");
        System.out.println("|    PROGRAM PENCARIAN DATA PENGIRIMAN BARANG DENGAN ALGORITMA JUMP SEARCH     |");
        System.out.println("|==============================================================================|");
        System.out.println("|Kasus Mencari Data Pengiriman Dengan No.Resi Menggunakan Algoritma Jump Search|");   
        System.out.println("");

        // Array untuk menampung nilai tiap Data
        Pengiriman[] arrayPengiriman = new Pengiriman[16];                 

        Pengiriman kirim1 = new Pengiriman (101101,"Adam Kamil","Jl.Anggrek","Bogor","Gunungbatu","16118"); 
        Pengiriman kirim2 = new Pengiriman (101102,"Putra Mandala","Jl.Apel","Kerawang","Kerawang Barat","41311"); 
        Pengiriman kirim3 = new Pengiriman (101103,"Mamat Sanusi","Jl.Merpati","Jakarta Selatan","Lenteng Agung","12610"); 
        Pengiriman kirim4 = new Pengiriman (101104,"Kamila Akhwan","Jl.Kelapa","Bekasi","Bekasi Timur","17111"); 
        Pengiriman kirim5 = new Pengiriman (101105,"Putra Iskandar","Jl.Anggrek 2","Bogor","Menteng","16111"); 
        Pengiriman kirim6 = new Pengiriman (101106,"Nabila Putri","Jl.Merapi","Palu","Tatanga","94239");
        Pengiriman kirim7 = new Pengiriman (101107,"Imam Satya","Jl.Pulau Nias","Manado","Bunaken","95231"); 
        Pengiriman kirim8 = new Pengiriman (101108,"Robby Dermawan","Jl.Tajung Pura","Yogyakarta","Gondokusuman","55225"); 
        Pengiriman kirim9 = new Pengiriman (101109,"Adrian Suta","Jl.Dewi Sartika","Banggai","Luwuk","94712"); 
        Pengiriman kirim10= new Pengiriman (1011010,"Rizky Prima","Jl.Gunung Jati","Jayawijaya","Wamena","99511"); 
        Pengiriman kirim11 = new Pengiriman (1011011,"Margareth Warouw","Jl.Sawit","Jakarta Timur","Cibubur","13720"); 
        Pengiriman kirim12 = new Pengiriman (1011012,"Jeni Indira","Jl.Tuna","Bekasi","Bekasi Barat","17136"); 
        Pengiriman kirim13 = new Pengiriman (1011013,"Asep Suratman","Jl.Palapa","Bogor","Margajaya","16116"); 
        Pengiriman kirim14 = new Pengiriman (1011014,"Gigi Purnama","Jl.Keraton Atas","Bekasi","Setu","17320"); 
        Pengiriman kirim15 = new Pengiriman (1011015,"Kamila Dewi","Jl.Dago Timur","Bandung","Coblong","40135"); 
        Pengiriman kirim16 = new Pengiriman (1011016,"Desy Sambeta","Jl.Proklamasi","Surabaya","Wonocolo","60239"); 

        //memasukan data mahasiswa ke dalam array
        arrayPengiriman[0]=kirim1;
        arrayPengiriman[1]=kirim2;
        arrayPengiriman[2]=kirim3;
        arrayPengiriman[3]=kirim4;
        arrayPengiriman[4]=kirim5;
        arrayPengiriman[5]=kirim6;
        arrayPengiriman[6]=kirim7;
        arrayPengiriman[7]=kirim8;
        arrayPengiriman[8]=kirim9;
        arrayPengiriman[9]=kirim10;
        arrayPengiriman[10]=kirim11;
        arrayPengiriman[11]=kirim12;
        arrayPengiriman[12]=kirim13;
        arrayPengiriman[13]=kirim14;
        arrayPengiriman[14]=kirim15;
        arrayPengiriman[15]=kirim16;



        Pengiriman tampilPengiriman = new Pengiriman();

        System.out.println("|==============================================================================|");
        System.out.println("|                                DATA PENGIRIMAN                               |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        for(int i = 0; i < 16; i++){
        //Menampilkan Array yang sudah disorting secara Ascending    
        tampilPengiriman = arrayPengiriman[i];

        System.out.print("  "+(i+1)+". ");
        System.out.print(tampilPengiriman.getNoResi()+" ");
        System.out.print(tampilPengiriman.getNamaPengirim()+" ");
        System.out.print(tampilPengiriman.getAlamatTujuan()+" ");
        System.out.print(tampilPengiriman.getKotaTujuan()+" ");
        System.out.print(tampilPengiriman.getKecamatanTujuan()+" ");
        System.out.println(tampilPengiriman.getKodePosTujuan()+" ");

        }

        System.out.println("");
        System.out.println("--------------------------------------------------------------------------------");


        System.out.println("|==============================================================================|");
        System.out.println("|                               CARI DATA PENGIRIMAN                           |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        //Memasukan 'noRes'
        System.out.print("\n    Masukkan No Resi yang ingin dicari datanya : ");
        int no_resi = scan.nextInt(); 

        // Mencari index dari 'x' dengan jump search
        int index = jumpsearch(arrayPengiriman, no_resi); 

        System.out.println("");
        System.out.println("--------------------------------------------------------------------------------");


        System.out.println("|==============================================================================|");
        System.out.println("|                       HASIL PENCARIAN DATA PENGIRIMAN                        |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        // Menampilkan index dimana 'x' ditemukan
        if (no_resi != -1 && index != -1) {
          System.out.println("\n Data pengiriman barang dengan" + no_resi + 
                            " ditemukan di index ke " + index); 
        } else {
          System.out.println("\n Data pengiriman dengan No Resi" + no_resi + 
                            " tidak ditemukan"); 
        }
        System.out.println("|==============================================================================|");
    }
}

彭吉爾曼.java

public class Pengiriman{

    private int no_resi;
    private String nama_pengirim;
    private String alamat_tujuan;
    private String kota_tujuan;
    private String kecamatan_tujuan;
    private String kode_pos_tujuan;

    public Pengiriman(){
        this.no_resi = 0;
        this.nama_pengirim = "";
        this.alamat_tujuan = "";
        this.kota_tujuan = "";
        this.kecamatan_tujuan = "";
        this.kode_pos_tujuan = "";
    }

    public Pengiriman(int no_resi,String nama_pengirim, String alamat_tujuan,
            String kota_tujuan, String kecamatan_tujuan, String kode_pos_tujuan){
        this.no_resi = no_resi;
        this.nama_pengirim = nama_pengirim;
        this.alamat_tujuan = alamat_tujuan;
        this.kota_tujuan = kota_tujuan;
        this.kecamatan_tujuan = kecamatan_tujuan;
        this.kode_pos_tujuan = kode_pos_tujuan;
    }

    public int getNoResi() {
        return no_resi;
    }
    public void setNoResi(int no_resi) {
        this.no_resi = no_resi;
    }
    public String getNamaPengirim() {
        return nama_pengirim;
    }
    public void setNamaPengirim (String nama_pengirim) {
        this.nama_pengirim = nama_pengirim;     
    } 
    public String getAlamatTujuan() {
        return alamat_tujuan;
    }
    public void setAlamatTujuan (String alamat_tujuan) {
        this.alamat_tujuan = alamat_tujuan;     
    } 
    public String getKotaTujuan() {
        return kota_tujuan;
    }
    public void setKotaTujuan (String kota_tujuan) {
        this.kota_tujuan = kota_tujuan;     
    } 
    public String getKecamatanTujuan() {
        return kecamatan_tujuan;
    }
    public void setKecamatanTujuan (String kecamatan_tujuan) {
        this.kecamatan_tujuan = kecamatan_tujuan;     
    }     
    public String getKodePosTujuan(){
        return kode_pos_tujuan;
    }
    public void setKodePosTujuan (String kode_pos_tujuan) {
        this.kode_pos_tujuan = kode_pos_tujuan;     
    }    
}

在大多數情況下,您的代碼可以正常工作,但是這里有一些小事情需要處理,還有一些需要考慮。 讓我們從Pengiriman class 開始。

在您的Pengiriman class 中,您有一個不接受任何參數的典型構造函數,並且在該構造函數中,您將所有 class 成員變量默認為0或 Null 字符串( “” )。 如果您只是在聲明的地方初始化變量,則可以消除此附加代碼。 每當創建Pengiriman的新實例時,這將使這些值成為默認值,例如:

public class Pengiriman{

    private int no_resi = 0;
    private String nama_pengirim = "";
    private String alamat_tujuan = "";
    private String kota_tujuan = "";
    private String kecamatan_tujuan = "";
    private String kode_pos_tujuan = "";

    public Pengiriman(){  }

    // ....     Overloaded Contructor(s)      ....

    // ....       Getters and Setters         ....  

    // ....  Nice to have a toString() method  ....
}

如果使用上面的構造函數,則需要使用 class 設置方法來填充這些變量,而不是使用它們初始化的默認值:

Pengiriman p = new Pengiriman();
p.setNoResi(101109);

class 中的其他(重載)構造函數接受所有 class 成員變量作為參數。 這很好,並且在創建 object 的陣列時使生活變得更輕松,因此,在創建陣列時,您需要做的就是:

Pengiriman[] arrayPengiriman = new Pengiriman[16];

arrayPengiriman[0] = new Pengiriman(101101, "Adam Kamil", "Jl.Anggrek", "Bogor", "Gunungbatu", "16118");
arrayPengiriman[1] = new Pengiriman(101102, "Putra Mandala", "Jl.Apel", "Kerawang", "Kerawang Barat", "41311");
arrayPengiriman[2] = new Pengiriman(101103, "Mamat Sanusi", "Jl.Merpati", "Jakarta Selatan", "Lenteng Agung", "12610");
// .....  etc.  .....

也不需要這樣做(因此可以將其刪除):

arrayPengiriman[0] = kirim1;
arrayPengiriman[1] = kirim2;
arrayPengiriman[2] = kirim3;
arrayPengiriman[3] = kirim4;
arrayPengiriman[4] = kirim5;
arrayPengiriman[5] = kirim6;
arrayPengiriman[6] = kirim7;
arrayPengiriman[7] = kirim8;
arrayPengiriman[8] = kirim9;
arrayPengiriman[9] = kirim10;
arrayPengiriman[10] = kirim11;
arrayPengiriman[11] = kirim12;
arrayPengiriman[12] = kirim13;
arrayPengiriman[13] = kirim14;
arrayPengiriman[14] = kirim15;
arrayPengiriman[15] = kirim16;

也不需要創建一個額外的數組來保存相同的排序值。 如果您已經有一個數組,為什么要這樣做? 只需對原始數組進行排序。 您使用的代碼無論如何都不會對數組進行排序。 它僅顯示元素。 您應該在Pengiriman class 中有一個 toString() 方法來執行此操作:

要對 object 數組進行排序,您需要確定要按升序排序的 object 數據。 當然,合乎邏輯的選擇是收據編號 (no_resi)。 要按 Object 的任何屬性對其進行排序,您必須使 Object 實現 Comparable 接口並覆蓋compareTo()方法。

//Your class must start with:
public class Pengiriman implements Comparable<Pengiriman> {

然后在 Pengiriman class 的某處:

// Sort by Receipt Number in 'Ascending Order'.
@Override
public int compareTo(Pengiriman comparePengiriman) {
    int compareNoResi = comparePengiriman.getNoResi();

    //ascending order
    return this.no_resi - compareNoResi;

    // If you want Descending order then use this instead:
    // return compareNoResi - this.no_resi;
}

因為現在您將在Pengiriman class 中有一個compareTo()方法,要對數組進行排序,您只需要使用這行代碼:

// Sort the Object Array        
Arrays.sort(arrayPengiriman);

Pengiriman class 中應該有的另一種方法是toString()方法,例如:

// Somewhere in the Pengiriman class:
@Override
public String toString() {
    return  no_resi + ", " + nama_pengirim + ", " + alamat_tujuan + 
            ", " + kota_tujuan + ", " + kecamatan_tujuan + ", " + 
            kode_pos_tujuan;
}

此方法無需從所有 object 數據構建字符串,而是您可以通過單個方法調用來完成此操作,例如:

System.out.println(arrayPengiriman[8].toString());

將在控制台 Window 中顯示:

101109, Adrian Suta, Jl.Dewi Sartika, Banggai, Luwuk, 94712

因此,在實現上述所有內容后,要顯示 Array 將是:

// Sort the Object Array        
Arrays.sort(arrayPengiriman);

System.out.println("|==============================================================================|");
System.out.println("|                                DATA PENGIRIMAN                               |");
System.out.println("|==============================================================================|");
System.out.println("");

// Displays the Sorted Array   
for (int i = 0; i < 16; i++) {
    System.out.print("  " + (i + 1) + ". " + arrayPengiriman[i].toString());
}

現在, JumpSearch class。 我知道我們已經觸及了 class 的大部分內容,但我想專注於jumpsearch()方法,因為在這種特殊方法中,您遇到了主要問題。

現在,我們知道了 Jump Search 是如何工作的,以及它只對排序的 arrays 起作用的事實。 有一個順序,這包括您如何為您的while循環實現條件。 以您使用的條件為例:

while (arrayPengiriman[1 - Math.min(step, n)] < no_resi) { 

想想這個用於獲取arrayPengiriman數組元素的索引值的方程: 1 - Math.min(step, n) 從 1 的值中減去Math.min(step, n)值,即1 1 - (calculated index value) 你認為你最終會得到什么樣的指數值? 確實... ArrayIndexOutOfBoundsException :它應該是:從Math.min(step, n)中減去1或換句話說(calculated index value) - 1

while (arrayPengiriman[Math.min(step, n) - 1] < no_resi) { 

但這只是這個while循環條件問題的一部分。 我們正在檢查數組的哪一部分以查看它是否小於 (<) no_resi arrayPengiriman[ n ]是 Pengiriman 的object實例,不能應用於該實例的所有屬性。 您需要告訴它您要比較的 object 實例的哪個屬性。 在這種特殊情況下,它是no_resi (收據編號)屬性,因此您需要以這種方式執行此操作:

while (arrayPengiriman[Math.min(step, n) - 1].getNoResi() < no_resi) {

是的,您需要使用其 Getter 方法 ( getNoResi() ) 獲取該特定 object 實例的收據編號,以便根據用戶提供的收據編號進行檢查。 再舉一個例子,如果您碰巧想要來自特定 object 實例的發件人名稱,那么您可以執行以下操作:

String senderName = arrayPengiriman[12].getNamaPengirim();

jumpsearch()方法中的第二個while循環完全包含錯誤的條件。 它應該是:

while (arrayPengiriman[prev].getNoResi() < no_resi) {

我確定這是一個復制/粘貼問題,因為它與第一個while循環的條件相同。 :) 請記住,這是此while循環中的線性搜索。 但請注意如何應用 Getter 方法 ( getNoResi() )。 jumpsearch()方法中的最終IF語句條件也需要使用此 Getter 方法:

if (arrayPengiriman[prev].getNoResi() == no_resi) {
        return prev;
}

我想你應該已經明白了。 這應該可以解決您的問題。

JumpSearch Class:

public class JumpSearch {

    public static int jumpsearch(Pengiriman[] arrayPengiriman, int no_resi) {
        int n = arrayPengiriman.length;

        // Find the block size to skip
        int step = (int) Math.floor(Math.sqrt(n));

        // Finds the block where the element is located
        // present (if element present)
        int prev = 0;
        while (arrayPengiriman[Math.min(step, n) - 1].getNoResi() < no_resi) {
            prev = step;
            step += (int) Math.floor(Math.sqrt(n));
            if (prev >= n) {
                return -1;
            }
        }

        // Perform a linear search for x in blocks
        // starts with prev
        while (arrayPengiriman[prev].getNoResi() < no_resi) {
            prev++;

            // If you reach the next or last block
            // array, missing element.
            if (prev == Math.min(step, n)) {
                return -1;
            }
        }

        // If an element is found
        if (arrayPengiriman[prev].getNoResi() == no_resi) {
            return prev;
        }
        return -1;
    }

    // Program for functional testing
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        System.out.println("|==============================================================================|");
        System.out.println("|    PROGRAM PENCARIAN DATA PENGIRIMAN BARANG DENGAN ALGORITMA JUMP SEARCH     |");
        System.out.println("|==============================================================================|");
        System.out.println("|    Case Finding Shipping Data With Recession Using Jump Search Algorithm     |");
        System.out.println("");

        // Array untuk menampung nilai tiap Data
        Pengiriman[] arrayPengiriman = new Pengiriman[16];

        arrayPengiriman[0] = new Pengiriman(101101, "Adam Kamil", "Jl.Anggrek", "Bogor", "Gunungbatu", "16118");
        arrayPengiriman[1] = new Pengiriman(101102, "Putra Mandala", "Jl.Apel", "Kerawang", "Kerawang Barat", "41311");
        arrayPengiriman[2] = new Pengiriman(101103, "Mamat Sanusi", "Jl.Merpati", "Jakarta Selatan", "Lenteng Agung", "12610");
        arrayPengiriman[3] = new Pengiriman(101104, "Kamila Akhwan", "Jl.Kelapa", "Bekasi", "Bekasi Timur", "17111");
        arrayPengiriman[4] = new Pengiriman(101105, "Putra Iskandar", "Jl.Anggrek 2", "Bogor", "Menteng", "16111");
        arrayPengiriman[5] = new Pengiriman(101106, "Nabila Putri", "Jl.Merapi", "Palu", "Tatanga", "94239");
        arrayPengiriman[6] = new Pengiriman(101107, "Imam Satya", "Jl.Pulau Nias", "Manado", "Bunaken", "95231");
        arrayPengiriman[7] = new Pengiriman(101108, "Robby Dermawan", "Jl.Tajung Pura", "Yogyakarta", "Gondokusuman", "55225");
        arrayPengiriman[8] = new Pengiriman(101109, "Adrian Suta", "Jl.Dewi Sartika", "Banggai", "Luwuk", "94712");
        arrayPengiriman[9] = new Pengiriman(1011010, "Rizky Prima", "Jl.Gunung Jati", "Jayawijaya", "Wamena", "99511");
        arrayPengiriman[10] = new Pengiriman(1011011, "Margareth Warouw", "Jl.Sawit", "Jakarta Timur", "Cibubur", "13720");
        arrayPengiriman[11] = new Pengiriman(1011012, "Jeni Indira", "Jl.Tuna", "Bekasi", "Bekasi Barat", "17136");
        arrayPengiriman[12] = new Pengiriman(1011013, "Asep Suratman", "Jl.Palapa", "Bogor", "Margajaya", "16116");
        arrayPengiriman[13] = new Pengiriman(1011014, "Gigi Purnama", "Jl.Keraton Atas", "Bekasi", "Setu", "17320");
        arrayPengiriman[14] = new Pengiriman(1011015, "Kamila Dewi", "Jl.Dago Timur", "Bandung", "Coblong", "40135");
        arrayPengiriman[15] = new Pengiriman(1011016, "Desy Sambeta", "Jl.Proklamasi", "Surabaya", "Wonocolo", "60239");

        // Sort the Object Array        
        Arrays.sort(arrayPengiriman);

        System.out.println("|==============================================================================|");
        System.out.println("|                                DATA PENGIRIMAN                               |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        // Displays the Ascending Sorted Array   
        for (int i = 0; i < 16; i++) {
            System.out.println("  " + (i + 1) + ". " + arrayPengiriman[i].toString());
        }

        // Apply the Search Mechanism...
        System.out.println("");
        System.out.println("--------------------------------------------------------------------------------");
        System.out.println("|==============================================================================|");
        System.out.println("|                               SEARCH SHIPPING DATA                           |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        // Enter 'noRes'
        System.out.print("    Enter the receipt number you want to search for: ");
        int no_resi = scan.nextInt();

        // Finding index of 'x' with jump search
        int index = jumpsearch(arrayPengiriman, no_resi);

        System.out.println("");
        System.out.println("--------------------------------------------------------------------------------");

        System.out.println("|==============================================================================|");
        System.out.println("|                       RESULTS OF SHIPPING DATA RESULTS                        |");
        System.out.println("|==============================================================================|");
        System.out.println("");

        // Displays the index where 'x' is found
        if (no_resi != -1 && index != -1) {
            System.out.println("Shipping data with " + no_resi
                    + " found in index to " + index);
        }
        else {
            System.out.println("Shipping data with Receipt No " + no_resi
                    + " not found");
        }
        System.out.println("|==============================================================================|");
    }
}

Pengiriman Class:

public class Pengiriman implements Comparable<Pengiriman> {

    private int no_resi = 0;
    private String nama_pengirim = "";
    private String alamat_tujuan = "";
    private String kota_tujuan = "";
    private String kecamatan_tujuan = "";
    private String kode_pos_tujuan = "";

    public Pengiriman() {  }

    public Pengiriman(int no_resi, String nama_pengirim, String alamat_tujuan,
            String kota_tujuan, String kecamatan_tujuan, String kode_pos_tujuan) {
        this.no_resi = no_resi;
        this.nama_pengirim = nama_pengirim;
        this.alamat_tujuan = alamat_tujuan;
        this.kota_tujuan = kota_tujuan;
        this.kecamatan_tujuan = kecamatan_tujuan;
        this.kode_pos_tujuan = kode_pos_tujuan;
    }

    public int getNoResi() {
        return no_resi;
    }

    public void setNoResi(int no_resi) {
        this.no_resi = no_resi;
    }

    public String getNamaPengirim() {
        return nama_pengirim;
    }

    public void setNamaPengirim(String nama_pengirim) {
        this.nama_pengirim = nama_pengirim;
    }

    public String getAlamatTujuan() {
        return alamat_tujuan;
    }

    public void setAlamatTujuan(String alamat_tujuan) {
        this.alamat_tujuan = alamat_tujuan;
    }

    public String getKotaTujuan() {
        return kota_tujuan;
    }

    public void setKotaTujuan(String kota_tujuan) {
        this.kota_tujuan = kota_tujuan;
    }

    public String getKecamatanTujuan() {
        return kecamatan_tujuan;
    }

    public void setKecamatanTujuan(String kecamatan_tujuan) {
        this.kecamatan_tujuan = kecamatan_tujuan;
    }

    public String getKodePosTujuan() {
        return kode_pos_tujuan;
    }

    public void setKodePosTujuan(String kode_pos_tujuan) {
        this.kode_pos_tujuan = kode_pos_tujuan;
    }

    @Override
    public int compareTo(Pengiriman comparePengiriman) {
        int compareNoResi = comparePengiriman.getNoResi();

        //ascending order
        return this.no_resi - compareNoResi;

        // If you want Descending order then use this instead:
        // return compareNoResi - this.no_resi;
    }

    @Override
    public String toString() {
        return no_resi + ", " + nama_pengirim + ", " + alamat_tujuan
                + ", " + kota_tujuan + ", " + kecamatan_tujuan + ", "
                + kode_pos_tujuan;
    }
}

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM