add 1403

fishercoder1534 · fishercoder1534 · commit bf796beb8ddb · 2020-04-05T07:40:33.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | |Easy|Greedy, Sort|
 |1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | |Medium|Geometry|
 |1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | |Medium|Greedy|
 |1399|[Count Largest Group](https://leetcode.com/problems/count-largest-group/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) | |Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1403.java b/src/main/java/com/fishercoder/solutions/_1403.java
@@ -0,0 +1,55 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.stream.Collectors;
+
+/**
+ * 1403. Minimum Subsequence in Non-Increasing Order
+ *
+ * Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence.
+ * If there are multiple solutions, return the subsequence with minimum size and if there still exist multiple solutions,
+ * return the subsequence with the maximum total sum of all its elements. A subsequence of an array can be obtained by erasing some (possibly zero) elements from the array.
+ * Note that the solution with the given constraints is guaranteed to be unique. Also return the answer sorted in non-increasing order.
+ *
+ * Example 1:
+ * Input: nums = [4,3,10,9,8]
+ * Output: [10,9]
+ * Explanation: The subsequences [10,9] and [10,8] are minimal such that the sum of their elements is strictly greater than the sum of elements not included, however, the subsequence [10,9] has the maximum total sum of its elements.
+ *
+ * Example 2:
+ * Input: nums = [4,4,7,6,7]
+ * Output: [7,7,6]
+ * Explanation: The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to returned in non-decreasing order.
+ *
+ * Example 3:
+ * Input: nums = [6]
+ * Output: [6]
+ *
+ * Constraints:
+ * 1 <= nums.length <= 500
+ * 1 <= nums[i] <= 100
+ * */
+public class _1403 {
+    public static class Solution1 {
+        public List<Integer> minSubsequence(int[] nums) {
+            List<Integer> list = Arrays.stream(nums)
+                    .boxed()
+                    .sorted(Collections.reverseOrder())
+                    .collect(Collectors.toCollection(() -> new ArrayList<>(nums.length)));
+            int sum = list.stream().mapToInt(num -> num).sum();
+            int minSum = 0;
+            List<Integer> result = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                if (minSum > (sum - minSum)) {
+                    return result;
+                }
+                minSum += list.get(i);
+                result.add(list.get(i));
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1403Test.java b/src/test/java/com/fishercoder/_1403Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1403;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1403Test {
+    private static _1403.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1403.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList(10, 9), solution1.minSubsequence(new int[]{4, 3, 10, 9, 8}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(Arrays.asList(7, 7, 6), solution1.minSubsequence(new int[]{4, 4, 7, 6, 7}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(Arrays.asList(6), solution1.minSubsequence(new int[]{6}));
+    }
+
+}
