g0501_0600.s0519_random_flip_matrix.Solution Maven / Gradle / Ivy

Go to download

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

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g0501_0600.s0519_random_flip_matrix;

// #Medium #Hash_Table #Math #Randomized #Reservoir_Sampling

import java.security.SecureRandom;
import java.util.HashSet;
import java.util.Set;

public class Solution {

    private final int cols;
    private final int total;
    private final SecureRandom rand;
    private final Set available;

    public Solution(int nRows, int nCols) {
        this.cols = nCols;
        this.rand = new SecureRandom();
        this.available = new HashSet<>();
        this.total = nRows * this.cols;
    }

    public int[] flip() {
        int x = rand.nextInt(this.total);
        while (available.contains(x)) {
            x = rand.nextInt(this.total);
        }

        this.available.add(x);
        return new int[] {x / this.cols, x % this.cols};
    }

    public void reset() {
        this.available.clear();
    }
}