Added solution for 1354.

Author: nrhitik

solution/1300-1399/1354.Construct Target Array With Multiple Sums/README.md

@@ -63,6 +63,29 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def isPossible(self, target: List[int]) -> bool:
+        if len(target) == 1:
+            return target[0] == 1
+
+        summ = sum(target)
+        maxHeap = [-num for num in target]
+        heapq.heapify(maxHeap)
+
+        while -maxHeap[0] > 1:
+            maxi = -heapq.heappop(maxHeap)
+            restSum = summ - maxi
+            # Only occurs if n == 2.
+            if restSum == 1:
+                return True
+            updated = maxi % restSum
+            # Updated == 0 (invalid) or didn't change.
+            if updated == 0 or updated == maxi:
+                return False
+            heapq.heappush(maxHeap, -updated)
+            summ = summ - maxi + updated
+
+        return True
 
 ```
 

solution/1300-1399/1354.Construct Target Array With Multiple Sums/README_EN.md

@@ -58,6 +58,29 @@
 ### **Python3**
 
 ```python
+class Solution:
+    def isPossible(self, target: List[int]) -> bool:
+        if len(target) == 1:
+            return target[0] == 1
+
+        summ = sum(target)
+        maxHeap = [-num for num in target]
+        heapq.heapify(maxHeap)
+
+        while -maxHeap[0] > 1:
+            maxi = -heapq.heappop(maxHeap)
+            restSum = summ - maxi
+            # Only occurs if n == 2.
+            if restSum == 1:
+                return True
+            updated = maxi % restSum
+            # Updated == 0 (invalid) or didn't change.
+            if updated == 0 or updated == maxi:
+                return False
+            heapq.heappush(maxHeap, -updated)
+            summ = summ - maxi + updated
+
+        return True
 
 ```
 

solution/1300-1399/1354.Construct Target Array With Multiple Sums/Solution.py

@@ -0,0 +1,23 @@
+class Solution:
+    def isPossible(self, target: List[int]) -> bool:
+        if len(target) == 1:
+            return target[0] == 1
+
+        summ = sum(target)
+        maxHeap = [-num for num in target]
+        heapq.heapify(maxHeap)
+
+        while -maxHeap[0] > 1:
+            maxi = -heapq.heappop(maxHeap)
+            restSum = summ - maxi
+            # Only occurs if n == 2.
+            if restSum == 1:
+                return True
+            updated = maxi % restSum
+            # Updated == 0 (invalid) or didn't change.
+            if updated == 0 or updated == maxi:
+                return False
+            heapq.heappush(maxHeap, -updated)
+            summ = summ - maxi + updated
+
+        return True