20210713#(68) 프로그래머스 50문제 뿌수기(2)

이코테 이진탐색 1, 프로그래머스3

분발좀;;하자

# s="ZAasdgbdf"

# s=list(str(s))

# s.sort()

# s="".join(s)

# print(s)

# #대문자는 소문자보다 작은걸로 간주

# if ord(s[i] 65~90:

# newarr.append(s[i])

# else:

# llist.append(s[i])

# s="ZAasdsghr"

# newlist=[];orilist=[]

# s=list(str(s))

# for i in s:

# if ord(i)>=65 and ord(i)<=90:

# newlist.append(i)

# else:

# orilist.append(i)

# # print(newlist,orilist)

# newlist.sort(reverse=True)

# orilist.sort(reverse=True)

# s=orilist+newlist

# s="".join(s)

# print(s)

 

# def solution(s):

# if s.count('p')+s.count('P')==s.count('y')+s.count('Y'):

# return True

# else:

# return False

 

# def solution(a, b):

# for i in range(a,b):

# i+=i

# return i

# print(solution(3,5))

 

# def solution(arr, divisor):

# answer = []

# chk=False

# for i in arr:

# if i%divisor==0:

# answer.append(i)

# chk=True

# if chk==False:

# return [-1]

# answer.sort()

# return answer

 

# print(solution([5,9,7,5,5,10], 5))