LC-2481 Easy LeetCode

2481. Minimum Cuts to Divide a Circle

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 55% Topics: Math, Geometry

Reading material

Reference solution (spoiler · python)

# Time:  O(1)
# Space: O(1)

# math
class Solution(object):
    def numberOfCuts(self, n):
        """
        :type n: int
        :rtype: int
        """
        return 0 if n == 1 else n if n%2 else n//2

Solution from kamyu104/LeetCode-Solutions · MIT