Arranging Coins LeetCode solution in Java

1
class Solution {
2
  public int arrangeCoins(int n) {
3
    long s = 0;
4
    long e = n;
5
    while (s <= e) {
6
      long mid = s + (e - s) / 2;
7
      long coin = mid * (mid + 1) / 2;
8
      if (coin > n) {
9
        e = mid - 1;
10
      } else if (coin < n) {
11
        s = mid + 1;
12
      } else return (int) mid;
13
    }
14
    return (int) e;
15
  }
16
}