DhondtMethod.java

public class DhondtMethod {

  public int[] partition(int totalSeats, int[] votes) {
    int[] seats = new int[votes.length];
    if (totalSeats == 0) {
      return seats;
    }
    if (votes.length == 0) {
      return seats;
    }
    for (int seat = 0; seat < totalSeats; seat++) {
      int bestSubject = 0;
      for (int subject = 0, max = Integer.MIN_VALUE; subject < votes.length; subject++) {
        int candidate = Math.round(votes[subject] / (seats[subject] + 1.0f));
        if (candidate > max) {
          bestSubject = subject;
          max = candidate;
        }
      }
      seats[bestSubject]++;
    }
    return seats;
  }
  
}