add 1333

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||
 |1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||

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

@@ -0,0 +1,64 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+import java.util.stream.Collectors;
+
+/**
+ * 1333. Filter Restaurants by Vegan-Friendly, Price and Distance
+ *
+ * Given the array restaurants where  restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei].
+ * You have to filter the restaurants using three filters.
+ * The veganFriendly filter will be either true (meaning you should only include restaurants with
+ * veganFriendlyi set to true) or false (meaning you can include any restaurant).
+ * In addition, you have the filters maxPrice and maxDistance which are the maximum value
+ * for price and distance of restaurants you should consider respectively.
+ * Return the array of restaurant IDs after filtering, ordered by rating from highest to lowest.
+ * For restaurants with the same rating, order them by id from highest to lowest.
+ * For simplicity veganFriendlyi and veganFriendly take value 1 when it is true, and 0 when it is false.
+ *
+ * Example 1:
+ * Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 1, maxPrice = 50, maxDistance = 10
+ * Output: [3,1,5]
+ * Explanation:
+ * The restaurants are:
+ * Restaurant 1 [id=1, rating=4, veganFriendly=1, price=40, distance=10]
+ * Restaurant 2 [id=2, rating=8, veganFriendly=0, price=50, distance=5]
+ * Restaurant 3 [id=3, rating=8, veganFriendly=1, price=30, distance=4]
+ * Restaurant 4 [id=4, rating=10, veganFriendly=0, price=10, distance=3]
+ * Restaurant 5 [id=5, rating=1, veganFriendly=1, price=15, distance=1]
+ * After filter restaurants with veganFriendly = 1, maxPrice = 50 and maxDistance = 10 we have restaurant 3, restaurant 1 and restaurant 5 (ordered by rating from highest to lowest).
+ *
+ * Example 2:
+ * Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 0, maxPrice = 50, maxDistance = 10
+ * Output: [4,3,2,1,5]
+ * Explanation: The restaurants are the same as in example 1, but in this case the filter veganFriendly = 0, therefore all restaurants are considered.
+ *
+ * Example 3:
+ * Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 0, maxPrice = 30, maxDistance = 3
+ * Output: [4,5]
+ *
+ * Constraints:
+ * 1 <= restaurants.length <= 10^4
+ * restaurants[i].length == 5
+ * 1 <= idi, ratingi, pricei, distancei <= 10^5
+ * 1 <= maxPrice, maxDistance <= 10^5
+ * veganFriendlyi and veganFriendly are 0 or 1.
+ * All idi are distinct.
+ * */
+public class _1333 {
+    public static class Solution1 {
+        public List<Integer> filterRestaurants(int[][] restaurants, int veganFriendly, int maxPrice, int maxDistance) {
+            List<int[]> list = new ArrayList<>();
+            for (int[] restaurant : restaurants) {
+                if (((veganFriendly == 1 && restaurant[2] == 1) || veganFriendly == 0)
+                        && restaurant[3] <= maxPrice && restaurant[4] <= maxDistance) {
+                    list.add(restaurant);
+                }
+            }
+            Collections.sort(list, (a, b) -> b[1] - a[1] == 0 ? b[0] - a[0] : b[1] - a[1]);
+            return list.stream().map(restaurant -> restaurant[0]).collect(Collectors.toList());
+        }
+    }
+}

src/test/java/com/fishercoder/_1333Test.java

@@ -0,0 +1,56 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1333;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1333Test {
+    private static _1333.Solution1 solution1;
+    private static int[][] restaurants;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1333.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        restaurants = new int[][]{
+                {1, 4, 1, 40, 10},
+                {2, 8, 0, 50, 5},
+                {3, 8, 1, 30, 4},
+                {4, 10, 0, 10, 3},
+                {5, 1, 1, 15, 1}
+        };
+        assertEquals(Arrays.asList(3, 1, 5), solution1.filterRestaurants(restaurants, 1, 50, 10));
+    }
+
+    @Test
+    public void test2() {
+        restaurants = new int[][]{
+                {1, 4, 1, 40, 10},
+                {2, 8, 0, 50, 5},
+                {3, 8, 1, 30, 4},
+                {4, 10, 0, 10, 3},
+                {5, 1, 1, 15, 1}
+        };
+        assertEquals(Arrays.asList(4, 3, 2, 1, 5), solution1.filterRestaurants(restaurants, 0, 50, 10));
+    }
+
+    @Test
+    public void test3() {
+        restaurants = new int[][]{
+                {1, 4, 1, 40, 10},
+                {2, 8, 0, 50, 5},
+                {3, 8, 1, 30, 4},
+                {4, 10, 0, 10, 3},
+                {5, 1, 1, 15, 1}
+        };
+        assertEquals(Arrays.asList(4, 5), solution1.filterRestaurants(restaurants, 0, 30, 3));
+    }
+
+}