🔀merge: [Week24] 2문제 완료 (#86)

* ✨feat: LTC_2300_Successful_Pairs_of_Spells_and_Potions 알고리즘 풀이

* ✨feat: LTC_238_Product_of_Array_Except_Self 알고리즘 풀이

jinny-l/week_24/LTC_2300_Successful_Pairs_of_Spells_and_Potions.java

@@ -0,0 +1,31 @@
+package week_24;
+
+import java.util.Arrays;
+
+public class LTC_2300_Successful_Pairs_of_Spells_and_Potions {
+
+ public int[] successfulPairs(int[] spells, int[] potions, long success) {
+ int[] answer = new int[spells.length];
+ // 이분 탐색을 위해 정렬
+ Arrays.sort(potions);
+
+ // spells 길이 만큼 반복
+ for (int i = 0; i < spells.length; i++) {
+ int left = 0;
+ int right = potions.length - 1;
+
+ // 이분탐색
+ while (left <= right) {
+ int mid = (left + right) / 2;
+
+ if ((long) potions[mid] * (long) spells[i] < success) {
+ left = mid + 1;
+ } else {
+ right = mid - 1;
+ }
+ }
+ answer[i] = potions.length - left;
+ }
+ return answer;
+ }
+}

jinny-l/week_24/LTC_238_Product_of_Array_Except_Self.java

@@ -0,0 +1,24 @@
+package week_24;
+
+import java.util.Arrays;
+
+public class LTC_238_Product_of_Array_Except_Self {
+ public int[] productExceptSelf(int[] nums) {
+ int[] answer = new int[nums.length];
+ // 1로 초기화
+ Arrays.fill(answer, 1);
+
+ // 왼쪽 곱셈
+ for(int i = 1; i < nums.length; i++) {
+ answer[i] = answer[i - 1] * nums[i - 1];
+ }
+
+ // 오른쪽 곱셈
+ int total = 1;
+ for (int i = nums.length - 1; i > 0; i--) {
+ total *= nums[i];
+ answer[i - 1] *= total;
+ }
+ return answer;
+ }
+}