add 1475

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1476|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Easy|Array|
 |1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|
 |1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java) | |Easy|Array|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|

src/main/java/com/fishercoder/solutions/_1475.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions;
+
+public class _1475 {
+    public static class Solution1 {
+        public int[] finalPrices(int[] prices) {
+            int[] result = new int[prices.length];
+            for (int i = 0; i < prices.length; i++) {
+                boolean foundDiscount = false;
+                for (int j = i + 1; j < prices.length; j++) {
+                    if (prices[j] <= prices[i]) {
+                        result[i] = prices[i] - prices[j];
+                        foundDiscount = true;
+                        break;
+                    }
+                }
+                if (!foundDiscount) {
+                    result[i] = prices[i];
+                }
+            }
+            result[prices.length - 1] = prices[prices.length - 1];
+            return result;
+        }
+    }
+}

src/test/java/com/fishercoder/_1475Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1475;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1475Test {
+    private static _1475.Solution1 solution1;
+    private static int[] prices;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1475.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        prices = new int[]{8, 4, 6, 2, 3};
+        assertArrayEquals(new int[]{4, 2, 4, 2, 3}, solution1.finalPrices(prices));
+    }
+
+}