[LeetCode] 374. Guess Number Higher or Lower - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/guess-number-higher-or-lower/description/ Guess Number Higher or Lower - 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 문제 We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Eve..
[LeetCode] 70. Climbing Stairs - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/climbing-stairs/ Climbing Stairs - 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 climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Exam..
[LeetCode] 238. Product of Array Except Self - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/product-of-array-except-self/ Product of Array Except Self - 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 an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. ..
[LeetCode] 121. Best Time to Buy and Sell Stock - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ 문제 You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, ret..
[LeetCode] 217. Contains Duplicate - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/contains-duplicate/ 문제 Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: Input: nums = [1,2,3,1] Output: true Example 2: Input: nums = [1,2,3,4] Output: false Example 3: Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true Constraints: 1
HYOJUN
'leetcode' 태그의 글 목록 (16 Page)