LeetCode Solutions/Problems/2481. Minimum Cuts to Divide a Circle.java
<reponame>DevashishPathrabe/LeetCodeclass Solution {
    public int numberOfCuts(int n) {
        if (n == 1){
            return 0;
        }
        if (n % 2 == 0){
            return n/2;
        }
        else{
            return n;
        }
    }
}