feat: add solutions to lc problem: No.1685. Sum of Absolute Differences

in a Sorted Array
neilwang0913 · Aug 1, 2021 · 7563cb1 · 7563cb1
1 parent f6488e3
commit 7563cb1
Show file tree

Hide file tree

Showing 6 changed files with 182 additions and 4 deletions.
diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/README.md b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/README.md
@@ -41,27 +41,90 @@ result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5。
 	<li><code>1 <= nums[i] <= nums[i + 1] <= 10<sup>4</sup></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+前缀和实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        presum = [0] * (n + 1)
+        for i in range(n):
+            presum[i + 1] = presum[i] + nums[i]
+        res = []
+        for i, num in enumerate(nums):
+            t = num * i - presum[i] + presum[n] - presum[i + 1] - num * (n - i - 1)
+            res.append(t)
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] getSumAbsoluteDifferences(int[] nums) {
+        int n = nums.length;
+        int[] presum = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
+            res[i] = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> getSumAbsoluteDifferences(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> presum(n + 1);
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        vector<int> res;
+        for (int i = 0; i < n; ++i) {
+            int t = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+            res.push_back(t);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func getSumAbsoluteDifferences(nums []int) []int {
+	n := len(nums)
+	presum := make([]int, n+1)
+	for i := 0; i < n; i++ {
+		presum[i+1] = presum[i] + nums[i]
+	}
+	var res []int
+	for i := 0; i < n; i++ {
+		t := nums[i]*i - presum[i] + presum[n] - presum[i+1] - nums[i]*(n-i-1)
+		res = append(res, t)
+	}
+	return res
+}
 ```
 
 ### **...**

diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/README_EN.md b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/README_EN.md
@@ -37,21 +37,82 @@ result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.
 	<li><code>1 &lt;= nums[i] &lt;= nums[i + 1] &lt;= 10<sup>4</sup></code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        presum = [0] * (n + 1)
+        for i in range(n):
+            presum[i + 1] = presum[i] + nums[i]
+        res = []
+        for i, num in enumerate(nums):
+            t = num * i - presum[i] + presum[n] - presum[i + 1] - num * (n - i - 1)
+            res.append(t)
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] getSumAbsoluteDifferences(int[] nums) {
+        int n = nums.length;
+        int[] presum = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
+            res[i] = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> getSumAbsoluteDifferences(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> presum(n + 1);
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        vector<int> res;
+        for (int i = 0; i < n; ++i) {
+            int t = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+            res.push_back(t);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func getSumAbsoluteDifferences(nums []int) []int {
+	n := len(nums)
+	presum := make([]int, n+1)
+	for i := 0; i < n; i++ {
+		presum[i+1] = presum[i] + nums[i]
+	}
+	var res []int
+	for i := 0; i < n; i++ {
+		t := nums[i]*i - presum[i] + presum[n] - presum[i+1] - nums[i]*(n-i-1)
+		res = append(res, t)
+	}
+	return res
+}
 ```
 
 ### **...**

diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.cpp b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.cpp
@@ -0,0 +1,16 @@
+class Solution {
+public:
+    vector<int> getSumAbsoluteDifferences(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> presum(n + 1);
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        vector<int> res;
+        for (int i = 0; i < n; ++i) {
+            int t = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+            res.push_back(t);
+        }
+        return res;
+    }
+};
diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.go b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.go
@@ -0,0 +1,13 @@
+func getSumAbsoluteDifferences(nums []int) []int {
+	n := len(nums)
+	presum := make([]int, n+1)
+	for i := 0; i < n; i++ {
+		presum[i+1] = presum[i] + nums[i]
+	}
+	var res []int
+	for i := 0; i < n; i++ {
+		t := nums[i]*i - presum[i] + presum[n] - presum[i+1] - nums[i]*(n-i-1)
+		res = append(res, t)
+	}
+	return res
+}
diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.java b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.java
@@ -0,0 +1,14 @@
+class Solution {
+    public int[] getSumAbsoluteDifferences(int[] nums) {
+        int n = nums.length;
+        int[] presum = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            presum[i + 1] = presum[i] + nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
+            res[i] = nums[i] * i - presum[i] + presum[n] - presum[i + 1] - nums[i] * (n - i - 1);
+        }
+        return res;
+    }
+}
diff --git a/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.py b/solution/1600-1699/1685.Sum of Absolute Differences in a Sorted Array/Solution.py
@@ -0,0 +1,11 @@
+class Solution:
+    def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        presum = [0] * (n + 1)
+        for i in range(n):
+            presum[i + 1] = presum[i] + nums[i]
+        res = []
+        for i, num in enumerate(nums):
+            t = num * i - presum[i] + presum[n] - presum[i + 1] - num * (n - i - 1)
+            res.append(t)
+        return res