feat: add js solution to lc problem: No.1475 (doocs#1025)

Author: Qiu-IT

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/README.md

@@ -392,6 +392,26 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} prices
+ * @return {number[]}
+ */
+var finalPrices = function (prices) {
+    for (let i = 0; i < prices.length; i++) {
+        for (let j = i + 1; j < prices.length; j++) {
+            if (prices[i] >= prices[j]) {
+                prices[i] -= prices[j];
+                break;
+            }
+        }
+    }
+    return prices;
+};
+```
+
 ### **...**
 
 ```

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/README_EN.md

@@ -363,6 +363,26 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} prices
+ * @return {number[]}
+ */
+var finalPrices = function (prices) {
+    for (let i = 0; i < prices.length; i++) {
+        for (let j = i + 1; j < prices.length; j++) {
+            if (prices[i] >= prices[j]) {
+                prices[i] -= prices[j];
+                break;
+            }
+        }
+    }
+    return prices;
+};
+```
+
 ### **...**
 
 ```

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/Solution.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} prices
+ * @return {number[]}
+ */
+var finalPrices = function (prices) {
+    for (let i = 0; i < prices.length; i++) {
+        for (let j = i + 1; j < prices.length; j++) {
+            if (prices[i] >= prices[j]) {
+                prices[i] -= prices[j];
+                break;
+            }
+        }
+    }
+    return prices;
+};