1 
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() 方法不能按我预期的方式工作，即比较整数！输出为 15 ，当正常工作时应该为 9 ， if(processed.contains(h1)==false) 当元素已经存在时返回 true ！

代码可能在哪里出错？

4

1 回答 1

0

逻辑有缺陷。processed.add(h1);被称为 N 次，但processed.contains(h1)被称为 N*N 次。因此，根据输入，您可以有 disorientationindex <> N。

于 2012-02-09T19:53:10.883 回答