[LeetCode] 190. Reverse Bits - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/reverse-bits/description/ Reverse Bits - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 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 a..
[LeetCode] 338. Counting Bits - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/counting-bits/description/ Counting Bits - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an integer n, return an array ans of length n + 1 such that for each i (0
[LeetCode] 191. Number of 1 Bits - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/number-of-1-bits/description/ Number of 1 Bits - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 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 la..
[LeetCode] 371. Sum of Two Integers - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/sum-of-two-integers/description/ Sum of Two Integers - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given two integers a and b, return the sum of the two integers without using the operators + and -. Example 1: Input: a = 1, b = 2 Output: 3 Examp..
[LeetCode] 11. Container With Most Water - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/container-with-most-water/description/ Container With Most Water - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i..
HYOJUN
'Java' 태그의 글 목록 (15 Page)