minimum_cuts_to_divide_a_circle.cpp

// 分割圆的最少切割次数
// https://leetcode.cn/problems/minimum-cuts-to-divide-a-circle
// INLINE  ../../images/math/minimum_cuts_to_divide_a_circle.jpeg

#include <headers.hpp>

class Solution {
public:
  int numberOfCuts(int n) {
    if (n == 1) {
      return 0;
    }
    if (n % 2 == 0) {
      return n / 2;
    }
    return n;
  }
};