[LeetCode Sync] Runtime - 223 ms (45.55%), Memory - 18.7 MB (97.78%)

Author: NinePiece2

Solutions/1284-four-divisors/README.md

@@ -0,0 +1,36 @@
+<p>Given an integer array <code>nums</code>, return <em>the sum of divisors of the integers in that array that have exactly four divisors</em>. If there is no such integer in the array, return <code>0</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [21,4,7]
+<strong>Output:</strong> 32
+<strong>Explanation:</strong> 
+21 has 4 divisors: 1, 3, 7, 21
+4 has 3 divisors: 1, 2, 4
+7 has 2 divisors: 1, 7
+The answer is the sum of divisors of 21 only.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [21,21]
+<strong>Output:</strong> 64
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 0
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+</ul>

Solutions/1284-four-divisors/solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def sumFourDivisors(self, nums: List[int]) -> int:
+        def checker(val: int) -> int:
+            i = 2
+            count, sum_val = 2, val + 1
+            while i <= val // i:
+                if val % i == 0:
+                    count += 1
+                    sum_val += i
+                    if i ** 2 != val:
+                        count += 1
+                        sum_val += val // i
+                i += 1
+                if count > 4:
+                    return 0
+            return sum_val if count == 4 else 0
+        
+        return sum(checker(val) for val in nums)