 ## [Leet Code] #2 Best Time to Buy and Sell Stock (Python3)

https://leetcode.com/problems/sum-of-two-integers/ 문제 > 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, return 0. Example 1: > Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (pri

2022년 10월 20일
·
0개의 댓글
· ## [Leet Code] #1 Two Sum (Python3)

https://leetcode.com/problems/two-sum/ 문제 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. Example 1: > Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums + nums == 9, we return [0, 1]. Example 2:

2022년 10월 19일
·
0개의 댓글
·