Leetcode Problem 507. Perfect Number

507. Perfect Number

Leetcode Solutions

If the input number is less than 2, return false since 1 is not a perfect number.
Initialize sum to 1 (since 1 is a divisor of all numbers).
Iterate from 2 to the square root of the input number. a. If the current number divides the input number evenly, it is a divisor. b. Add the divisor and its complement (input number divided by the divisor) to sum.
After the loop, check if sum equals the input number. If it does, return true; otherwise, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen