Solve find in mountain array

sangaryousmane · Jun 14, 2023 · 2d8f912 · 2d8f912
1 parent 34a595d
commit 2d8f912
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 4 deletions.
diff --git a/out/production/java-interview-questions/Main.class b/out/production/java-interview-questions/Main.class
diff --git a/src/Main.java b/src/Main.java
@@ -8,8 +8,9 @@ public class Main {
     public static void main(String[] args) {
 
         int[] arr = {1, 2, 3, 1};
-        int result = Searching.peakMountain(arr);
-        System.out.println(result);
+        int[]aliceSizes = {2}, bobSizes = {1,3};
+        int[] result = Searching.fairCandySwap(aliceSizes, bobSizes);
+        System.out.println(Arrays.toString(result));
     }
 
 

diff --git a/src/intermediate/Searching.java b/src/intermediate/Searching.java
@@ -551,7 +551,7 @@ public static int peakMountain(int[] nums) {
     }
 
     // https://leetcode.com/problems/fair-candy-swap/description/
-    public int[] fairCandySwap(int[] aliceSizes, int[] bobSizes){
+    public static int[] fairCandySwap(int[] aliceSizes, int[] bobSizes){
         int aliceTotal = 0, bobTotal = 0;
 
         for (int aliceCandy: aliceSizes)
@@ -563,10 +563,11 @@ public int[] fairCandySwap(int[] aliceSizes, int[] bobSizes){
             bobCandySizes.add(bobCandy);
         }
 
+        // Search for the pair of candies
         int diffOfCandies=(bobTotal - aliceTotal) / 2;
         for (int alice: aliceSizes){
             if (bobCandySizes.contains(alice+diffOfCandies)){
-                return new int[]{alice, alice + diffOfCandies};
+                return new int[]{alice, alice+diffOfCandies};
             }
         }
         return null;