g2801_2900.s2860_happy_students.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g2801_2900.s2860_happy_students;

// #Medium #Array #Sorting #Enumeration #2023_12_19_Time_33_ms_(91.76%)_Space_55.3_MB_(82.94%)

import java.util.Collections;
import java.util.List;

public class Solution {
    public int countWays(List nums) {
        Collections.sort(nums);
        int cnt = 0;
        int n = nums.size();
        if (nums.get(0) != 0) {
            cnt++;
        }
        for (int i = 0; i < n - 1; i++) {
            if (nums.get(i) < (i + 1) && (nums.get(i + 1) > (i + 1))) {
                cnt++;
            }
        }
        if (n > nums.get(n - 1)) {
            cnt++;
        }
        return cnt;
    }
}