From LeetCode. Circle division symmetry. Solve the geometry problem "Minimum Cuts to Divide a Circle".
Examples
Input:[1,2,3]
Output:0
Input:[2,3,4]
Output:0
Hints
Valid cuts are diameters (through center, 2 edge points) or radii (center to 1 edge point). One diameter cut splits circle into 2 equal slices.
For even n, n/2 diameter cuts suffice — each diameter produces 2 opposite slices. For odd n > 1, each cut can only create 1 new equal sector, so need n cuts.
n = 1 is special case requiring 0 cuts (whole circle already 1 piece). Formula: (n == 1) ? 0 : (n % 2 == 0 ? n / 2 : n).
Minimum Cuts to Divide a Circle
**From LeetCode.** Circle division symmetry. Solve the geometry problem "Minimum Cuts to Divide a Circle".