daily

Author: Zanger67

my-submissions/e2570 v1.py

@@ -0,0 +1,5 @@
+class Solution:
+    def mergeArrays(self, nums1: List[List[int]], nums2: List[List[int]]) -> List[List[int]]:
+        output = {_id:_val for _id, _val in nums1}
+        output.update({_id: _val + output.get(_id, 0) for _id, _val in nums2})
+        return sorted([tuple(x) for x in output.items()])

my-submissions/e2570 v2.py

@@ -0,0 +1,5 @@
+class Solution:
+    def mergeArrays(self, nums1: List[List[int]], nums2: List[List[int]]) -> List[List[int]]:
+        output = {_id:_val for _id, _val in nums1}
+        output.update({_id: _val + output.get(_id, 0) for _id, _val in nums2})
+        return sorted(output.items())

my-submissions/e2570 v3.py

@@ -0,0 +1,3 @@
+class Solution:
+    def mergeArrays(self, nums1: List[List[int]], nums2: List[List[int]]) -> List[List[int]]:
+        return sorted(((output := {_id:_val for _id, _val in nums1}).update({_id: _val + output.get(_id, 0) for _id, _val in nums2}), output.items())[1])