[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..
[LeetCode] 15. 3Sum - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/3sum/description/ 3Sum - 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 array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the sol..
[Leetcode] 263. Ugly Number - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/ugly-number/description/ Ugly Number - 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 문제 An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return true if n is an ugly number. Example 1: Input: n =..
[LeetCode] 153. Find Minimum in Rotated Sorted Array - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Find Minimum in Rotated Sorted Array - 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 문제 Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,..
HYOJUN
'알고리즘' 태그의 글 목록 (15 Page)