簡體   English   中英

在Java中將TreeSet contains()與整數一起使用

[英]Using TreeSet contains() in Java with Integers

import java.io.*;
import java.util.*;

class StepfordHouses {

    private ArrayList<Integer> houses; // A list containing houses
    private TreeSet<Integer> ordered; // An ordered treeset of houses
    private TreeSet<Integer> processed; // Elements already processed
    private String inpline[]; // An array of String holing houses heights in physical order
    private int disorientedindex; // The index for the Street
    private int size; // Number of houses in the Street

    public StepfordHouses() // Constructor for init
    {
        houses = new ArrayList<Integer>();
        ordered = new TreeSet<Integer>();
        processed = new TreeSet<Integer>();

        // Basic Input from Text-File (Codechef Requirment)
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(
                    System.in));

            size = Integer.parseInt(br.readLine());
            inpline = br.readLine().split(" ");
        } catch (IOException e) {
            System.out.println("BAAAAAAAAAM!!");
        }

        for (int c = 0; c < size; c++) // Populating Houses
        {
            Integer tmp = Integer.parseInt(inpline[c]);
            houses.add(tmp);
            ordered.add(tmp);
        }
    }

    public int calcIndex() 
    {
        int c = 0;

        while (c < size) {
            Iterator<Integer> it = ordered.iterator();

            Integer h1 = houses.get(c); // Get an element from the raw ArrayList of Houses
            Integer h = it.next(); // Get an element from the Iterator

            while (h1.equals(h) != true) {
                if (processed.contains(h1) == false) { // The element is not already processed
                    System.out.println(h1 + " " + h);
                    disorientedindex++;
                }
                h = it.next(); // Get an element from the Iterator
            }

            processed.add(h1);
            c++;
            it = null;
        }

        return disorientedindex;
    }

}

public class Work {
    public static void main(String args[]) {
        StepfordHouses sh = new StepfordHouses();
        System.out.println(sh.calcIndex());
    }
}

contains()方法無法按我期望的方式工作,即比較Integers! 輸出為15, if(processed.contains(h1)==false)正常工作, if(processed.contains(h1)==false)輸出為9;當元素已經存在時返回true!

代碼在哪里可能出錯?

邏輯有缺陷。 processed.add(h1); 被稱為N次但已processed.contains(h1)被稱為N * N次。 因此,根據輸入,您可以具有disdirectionindex <>N。

暫無
暫無

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

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