본문 바로가기
반응형

<개인공부> - IT/[Python]38

Best time to buy and sell stock II (1-line python code) Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).Example 1:Input: [7,1,5,3,6,4].. 2019. 1. 15.
13. Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.Roman numerals are usually written largest to smallest from left to.. 2019. 1. 12.
Two pointer approach (11. Container with most water) Q. Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line iis at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.Note: You may not slant the container and n is at least 2.Example:Input: [1,8,6,2,5,4,8,3,7] O.. 2019. 1. 11.
Python in operator (Regular Expression Matching) Nowadays I really focus on preparing coding interview. I am going to briefly summarize and post what I learn and study. text = "aa" pattern = "a" # Whether pattern is null or not # if it is null return False if not pattern: return not text # Input text is not null # Pattern has the same character or '.' first_match = bool(text) and pattern[0] in {text[0], '.'} if len(pattern) >= 2 and pattern[1].. 2019. 1. 10.
반응형