노란 구슬 굽는 중

371. Sum of Two IntegersLeetCodeGiven an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.정수 배열 nums가 주어졌을 때, 배열 내에 어떤 값이 최소 두 번 이상 나타나면 true를 반환하고, 모든 요소가 고유하다면(중복이 없으면) false를 반환하세요. ExampleInput: nums = [1,2,3,1]Output: trueExplanation: The element 1 occurs at the indices 0 and 3.Input: nums = [1,2,3,4]Output: fals..

121. Best Time to Buy and Sell StockLeetCodeYou 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, return 0.prices[i]가 i번째 날의 ..