Solve special array and next letters

sangaryousmane · Jun 8, 2023 · 34737db · 34737db
1 parent 0f0baed
commit 34737db
Show file tree

Hide file tree

Showing 3 changed files with 23 additions and 3 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
@@ -7,9 +7,8 @@ public class Main {
 
     public static void main(String[] args) {
 
-        char[] arr = {'x','x','y', 'y'};
-        char target = 'x';
-        char result = Searching.nextGreatestLetter(arr, target);
+        int[][] arr = {{4,3,2,-1},{3,2,1,-1}};
+        int result = Searching.countNegativeNumbers(arr);
         System.out.println(result);
     }
 

diff --git a/src/intermediate/Searching.java b/src/intermediate/Searching.java
@@ -411,4 +411,25 @@ else if (count < middle)
         }
         return -1;
     }
+    // https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/description/
+    public static int countNegativeNumbers(int[][] nums){
+        int count = 0;
+
+        for (int i = 0; i < nums.length; i++){
+            int start = 0, end = nums[i].length - 1;
+
+            while (start <= end){
+                int middle = start + (end - start) / 2;
+
+                if (nums[i][middle] < 0){
+                    count += start - middle + 1;
+                    end = middle - 1;
+                }
+                else{
+                    start = middle + 1;
+                }
+            }
+        }
+        return count;
+    }
 }