Thursday, April 14, 2022

Leet Code 744. Find Smallest Letter Greater Than Target

https://leetcode.com/problems/find-smallest-letter-greater-than-target/

If question me sorted array hai then try to apply binary sort

Example 1:

Input: letters = ["c","f","j"], target = "c"
Output: "f"










package pep.Day63;

public class LeetCode_744_Find_Smallest_Letter_Greater_Than_Target {
public static void main(String[] args) {
System.out.println(nextGreatestLetter(new char[]{'c', 'f', 'j'}, 'c'));
}

public static char nextGreatestLetter(char[] letters, char target) {
int start = 0, end = letters.length - 1;

while (start <= end) {
int mid = start + (end - start) / 2;
if (letters[mid] <= target) {
start = mid + 1;
} else {
end = mid - 1;
}
}

return letters[start % letters.length];
}
}



No comments:

Post a Comment

Diagonal Traversal

 eg.  1       2       3       4 5      6       7       8 9    10    11     12 13  14   15    16 Output: 1 6 11 16 2 7 12 3 8 4  Approach:...