본문 바로가기
반응형

파이썬19

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.
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 Multiple return values (Tuple, Dict) # Question:# Write a program that accepts a sentence and calculate the number #of letters and digits.# Suppose the following input is supplied to the program:# hello world! 123# Then, the output should be:# LETTERS 10# DIGITS 3 [Tuple 이용] def countingStr(sentence): countNum = 0 countChar = 0 for i in range(len(sentence)): if((65 2018. 8. 23.
List 자료형의 Join함수 사용하기 Question:Write a program which will find all such numbers which are divisible by 7 but are not a multiple of 5,between 2000 and 3200 (both included).The numbers obtained should be printed in a comma-separated sequence on a single line. def divisibleSevenNotDivisibleFive(): listOfNumber = "" # Range: 2000 ~ 3200 for i in range(2000, 3201): if((i % 7 == 0) and (i % 5 != 0)): listOfNumber = listOfN.. 2018. 8. 21.
반응형

티스토리툴바