Merge branch 'main' of github.com:tkzzzzzz6/Algorithm_beginner_learning_notes

Author: ttkqwe123

CCF-CSP/40/A. 集合.cpp CCF-CSP/40-A. 集合.cppCCF-CSP/40/A. 集合.cpp renamed to CCF-CSP/40-A. 集合.cpp

@@ -0,0 +1,14 @@
+ac
+# [2574] 左右元素和的差值
+
+
+class Solution:
+    def leftRightDifference(self, nums: List[int]) -> List[int]:
+        res = []
+        total = sum(nums)
+        leftsum = 0
+        for i in range(len(nums)):
+            res.append(abs(total - 2*leftsum - nums[i]))
+            leftsum += nums[i]
+
+        return res

leetcode/problems/2574.left-and-right-sum-differences.md

@@ -0,0 +1,40 @@
+#
+# @lc app=leetcode.cn id=2574 lang=python3
+# @lcpr version=30204
+#
+# [2574] 左右元素和的差值
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+
+# total = leftsum + nums[i] + rightsum
+# |rightsum - leftsum| = |total - 2*leftsum - nums[i]|
+
+class Solution:
+    def leftRightDifference(self, nums: List[int]) -> List[int]:
+        res = []
+        total = sum(nums)
+        leftsum = 0
+        for i in range(len(nums)):
+            res.append(abs(total - 2*leftsum - nums[i]))
+            leftsum += nums[i]
+
+        return res
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# [10,4,8,3]\n
+# @lcpr case=end
+
+# @lcpr case=start
+# [1]\n
+# @lcpr case=end
+
+#