package pep.Day82;
public class UTF8_Encoding {
public static void main(String[] args) {
int[] arr = {197, 1};
for (int i : arr) {
System.out.println(Integer.toBinaryString(i));
}
System.out.println(solution(arr));
}
private static boolean solution(int[] arr) {
int byteToBeChecked = 0;
for (int i : arr) {
// pehle byte check krne ke lea
if (byteToBeChecked == 0) {
if (i >> 7 == 0b0)
byteToBeChecked = 0;
else if (i >> 5 == 0b110)
byteToBeChecked = 1;
else if (i >> 4 == 0b1110)
byteToBeChecked = 2;
else if (i >> 3 == 0b11110)
byteToBeChecked = 3;
} else {
// agr byteToBeChecked= 1,2,3 to baki sab remaining byte 10 se start hogi
if (i >> 6 != 0b10)
return false;
byteToBeChecked--;
}
}
if (byteToBeChecked == 0)
return true;
return false;
}
}
Monday, May 23, 2022
Utf - 8 Encoding
Subscribe to:
Post Comments (Atom)
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:...
-
https://leetcode.com/problems/reverse-integer/description/ Integer.MAX_VALUE = 2,147,483,647 = 2 31 - 1 Integer.MIN_VALUE = -2,147,483,64...
-
https://leetcode.com/problems/two-sum/description/ Given the constraints: 2 <= nums.length <= 10⁴ -10⁹ <= nums[i] <= 10⁹ -10...
-
For this particular question, we only have the In - region. So, the code looks like : package pep.Day7 ; public class TowerOfHanoi { p...




No comments:
Post a Comment