Number of Ways to Rearrange Sticks With K Sticks Visible LeetCode solution in Java

1
class Solution {
2
  public int rearrangeSticks(int n, int k) {
3
    final int MOD = 1_000_000_007;
4
    long[][] M = new long[k + 1][n + 1];
5
    M[0][0] = 1;
6
    for (int i = 1; i <= k; i++) {
7
      for (int j = 1; j <= n; j++) {
8
        M[i][j] = ((j - 1) * M[i][j - 1] % MOD + M[i - 1][j - 1]) % MOD;
9
      }
10
    }
11
    return (int) M[k][n];
12
  }
13
}