Quiz: Remove Tags
def remove_tags(string):
start = string.find('<')
while start != -1:
end = string.find('>',start)
string = string[:start] + " " + string[end + 1:]
start = string.find('<')
print(start)
return string.split()
print remove_tags('''<h1>Title</h1><p>This is a
<a href="http://www.udacity.com">link</a>.<p>''')
Quiz: Date Converter
english = {1:"January", 2:"February", 3:"March", 4:"April", 5:"May",
6:"June", 7:"July", 8:"August", 9:"September",10:"October",
11:"November", 12:"December"}
# then "5/11/2012" should be converted to "11 May 2012".
# If the dictionary is in Swedish
swedish = {1:"januari", 2:"februari", 3:"mars", 4:"april", 5:"maj",
6:"juni", 7:"juli", 8:"augusti", 9:"september",10:"oktober",
11:"november", 12:"december"}
# then "5/11/2012" should be converted to "11 maj 2012".
# Hint: int('12') converts the string '12' to the integer 12.
#민우코드
def date_converter(lang, date):
newdate = date.split('/')
temp = newdate[0]
newdate[0] = newdate[1]
newdate[1] = temp
newdate[1] = lang[int(newdate[1])]
return " ".join(newdate)
#udacity
#넘나 간단한거ㅅ..
def date_conver(lang, date):
month, day, year = date.split('/')
return day + " " + lang[int(month)] + " " + year
print date_converter(english, '5/11/2012')
#>>> 11 May 2012
Quiz: Longest Repetition
#민우코드
#list내에 배열같이 그지같은게 있으면불가능
def longest_repetition(arr):
newHash = {}
temp = 0
best = None
for item in arr:
if not item in newHash:
newHash[item] = 1
else:
newHash[item] += 1
if temp < newHash[item]:
temp = newHash[item]
best = item
return best
#유다시티
#왠만한경우는 다통과함.
def longest_repetition(input_list):
best_element = None
length = 0
current= None
current_length = 0
for element in input_list:
if current != element:
current = element
current_length = 1
else:
current_length = current_length + 1
#여기서 뒤에나오는 다른 엘리먼ㅌ으와 크기를 비교해 더크지 앟는이상 best를 안바꺼준다.
if current_length > length:
best_element = current
length = current_length
return best_element
Quiz: Deep Reverse
def deep_reverse(p):
if is_list(p):
result = []
for i in range(len(p)-1,-1,-1):
result.append(deep_reverse(p[i])) #뒤부터 순서대로 값을 먼저넣는다.
return result
else:
return p
p = [1, [2, 3, [4, [5, 6]]]]
print deep_reverse(p)
#>>> [[[[6, 5], 4], 3, 2], 1]
range()
range(start,stop,step) #=>stop은 포함안된다.
#예
range(10-1,-1,-1) #=> 9부터 0까지 -1씩줄어든다.