💻 Jihun's Ifuwanna IT :: Tech Blog 😃
bit manipulation 검색 결과

해당 글 4건

[LeetCode] 190. Reverse Bits - 문제풀이

Description 주어진 부호없는 32비트 정수를 뒤집어서 반환하는 문제입니다. Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In..
알고리즘/LeetCode 2022. 2. 15. 02:09

[LeetCode] 191. Number of 1 Bits - 문제풀이

Description 주어진 정수의 bit(1)의 개수를 반환하는 문제입니다. Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary repre..
알고리즘/LeetCode 2022. 2. 15. 01:31

[LeetCode] 231. Power of Two - 문제풀이

Description 주어진수가 2의 제곱에 포함되는지 여부를 반환하는 문제입니다. Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2x. Example 1: Input: n = 1 Output: true Explanation:2^0 = 1 Example 2: Input: n = 16 Output: true Explanation:2^4 = 16 Example 3: Input: n = 3 Output: false Constraints: -2^31 0010000 n-1 > 11..
알고리즘/LeetCode 2022. 2. 14. 23:52

[LeetCode] 389. Find the Difference - 문제풀이

Description s문자열을 무작위로 섞은뒤 하나의문자열을 추가해 만든 t가 있을때 추가된 문자를 구하는 문제입니다. You are given two strings s and t. String t is generated by random shuffling string s and then add one more letter at a random position. Return the letter that was added to t. Example 1: Input: s = "abcd", t = "abcde" Output: "e" Explanation: 'e' is the letter that was added. Example 2: Input: s = "", t = "y" Output: "y" Constra..
알고리즘/LeetCode 2022. 2. 7. 11:38