Skip to content

2481. Minimum Cuts to Divide a Circle 👍

  • Time: $O(1)$
  • Space: $O(1)$
1
2
3
4
5
6
7
8
class Solution {
 public:
  int numberOfCuts(int n) {
    if (n == 1)
      return 0;
    return n & 1 ? n : n / 2;
  }
};

1
2
3
4
5
6
7
class Solution {
  public int numberOfCuts(int n) {
    if (n == 1)
      return 0;
    return n % 2 == 0 ? n / 2 : n;
  }
}

1
2
3
4
5
class Solution:
  def numberOfCuts(self, n: int) -> int:
    if n == 1:
      return 0
    return n if n & 1 else n // 2