Add Minimum Number of Rungs LeetCode solution in Java

1
class Solution {
2
  public int addRungs(int[] rungs, int dist) {
3
    int ans = 0;
4
    for (int i = 0; i < rungs.length; i++) {
5
      int d = (i == 0) ? rungs[i] : rungs[i] - rungs[i - 1];
6
      if (d > dist) {
7
        ans += d / dist;
8
        ans += (d % dist == 0) ? -1 : 0;
9
      }
10
    }
11
    return ans;
12
  }
13
}