feat: add typescript solution to lc problem: No.1913.Maximum Product Difference Between Two Pairs (#484)

Author: zhaocchen

solution/1900-1999/1913.Maximum Product Difference Between Two Pairs/README.md

@@ -75,6 +75,21 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxProductDifference = function(nums) {
+    nums.sort((a, b) => a - b);
+    let n = nums.length;
+    let ans = nums[n - 1] * nums[n - 2] - nums[0] * nums[1];
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1900-1999/1913.Maximum Product Difference Between Two Pairs/README_EN.md

@@ -96,6 +96,21 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxProductDifference = function(nums) {
+    nums.sort((a, b) => a - b);
+    let n = nums.length;
+    let ans = nums[n - 1] * nums[n - 2] - nums[0] * nums[1];
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1900-1999/1913.Maximum Product Difference Between Two Pairs/Solution.js

@@ -0,0 +1,10 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var maxProductDifference = function(nums) {
+    nums.sort((a, b) => a - b);
+    let n = nums.length;
+    let ans = nums[n - 1] * nums[n - 2] - nums[0] * nums[1];
+    return ans;
+};