Merge pull request #39 from zaqquum/main

김홍주 / 7월 1주차 / 6개

Author: zaqquum

Hongjoo/lv0/숫자제거배열.py

@@ -0,0 +1,17 @@
+
+#1. input 
+n,k = input().split()
+a = list(input().split())
+
+# n,k = "5 2".split()
+# a = list("10 20 22 12 11".split())
+count = 0
+for i in range(len(a)):
+	if k in a[i]:
+		count+=1
+
+answer = int(n) - count
+print(f"{answer}")
+
+
+# print ("Hello Goorm! Your input is " + user_input)

Hongjoo/lv0/정사각형의개수.py

@@ -0,0 +1,17 @@
+
+n = int(input())
+sum = 0 
+for i in range(n): #0,1,2,3
+	sum+= (n-i)**2
+	
+print(sum)
+
+
+"""
+1,2,3,4
+1,2,3,4
+1,2,3,4
+1,2,3,4
+16(4*4)+(4-1)^2+ (4-2)^2 + (4-3)^1
+"""
+

Hongjoo/lv1/구름스퀘어.py

@@ -0,0 +1,28 @@
+
+# input
+events =[] # [start , end]
+# n = map(int, input())
+# for i in range(n):
+# 	s, e = map(int,input().split())
+# 	events.append([s,e])
+
+n = int(input())
+for i in range(n):
+	s,e = map(int, input().split())
+	s= int(s); e= int(e)
+	events.append([s,e])
+#우선순위 greedy : 끝나는 시간 빠른 순 정렬 -> 시작시간 빠른 순
+events.sort(key= lambda x: x[1])
+schdule = []
+end_time = -1
+count= 0
+for event in events : 
+	if event[0] > end_time :
+		schdule.append(event)
+		count+= 1
+		end_time = event[1]
+	
+# count = len(schdule)
+
+# print(f'schedule {schdule}, ->  {count}')	
+print(count)

Hongjoo/lv1/이진수정렬.py

@@ -0,0 +1,26 @@
+# n ,k = int(input().split()) # 개수, 특정 정수 위치
+# array = list(map(int,input().split()))
+def binary(num):
+	tmp = ""
+	while num	!=0 : 
+		if num % 2 == 0 : 
+			tmp= "0"+tmp
+			num = num // 2
+		else :
+			tmp = "1" + tmp
+			num = num // 2
+	return tmp
+	
+	
+n ,k = map(int,input().split()) # 개수, 특정 정수 위치
+array = list(map(int,input().split()))
+
+bcount_o = []
+for o in array : 
+	l=binary(o).count("1")
+	bcount_o.append([l,o])
+
+# 내림차순 정렬
+bcount_o.sort(reverse= True)
+print(bcount_o[k-1][1])
+

Hongjoo/lv2/괄호변환.py

@@ -0,0 +1,56 @@
+answer = ''
+def u_notcorrect(u,v):
+    #4-4 자르고 -> 뒤집기
+    u = list(u[1:-1]) # 4-4
+    if bool(u) :
+        for i in range(len(u)):
+            if u[i]==")":
+                u[i] = "("
+            else :
+                u[i] = ")"
+        
+    u = "".join(u)
+    # 4-1, 4-2,4-3
+    tmp= '(' + cut_wuv(v) +')' + str(u) 
+    return tmp
+
+
+def isCorrectString(u) :  # u = p[s:e+1]
+    count = 0
+    for s in u : 
+        if s == "(" :
+            count+=1
+        elif s == ")" :
+            count-=1
+        if count < 0 : 
+            return False 
+    return count == 0
+     
+def cut_wuv(w): 
+    global answer
+    # 1. 빈 문자열 -> 빈 문자열
+    if w == "": 
+        return ""
+    #2 w = u+v로 나누기
+    e =0 #end idx 가리키는 two point
+    while e < len(w): 
+        e +=1
+         # u 구하기 #2
+        if w[:e+1].count('(') == w[:e+1].count(')'):
+            w=w[:] ;u = w[:e+1] ; v = w[e+1:]
+            break
+    
+    # 3. 
+    if not isCorrectString(u): #4올바른 괄호 문자열 x(onlt 균형 잡힌 문자열)
+        answer+=str(u_notcorrect(u,v))
+        return answer
+                
+    else : #3 u 가 올바른 괄호 문자열
+        answer =  str(u) +cut_wuv(v)
+        return answer 
+
+    
+def solution(p):
+    global answer 
+    answer=cut_wuv(p)
+    return answer

Hongjoo/lv2/큰수식찾기.py

@@ -0,0 +1,34 @@
+
+def func(f):
+	# 1, ops (종류) , 위치 찾기
+	f = list(f)
+	answer =0
+	ops = []
+	nums =[]
+	s = 0
+	for i in range(len(f)):
+		if f[i] in ["+","*","-"] :
+			ops.append([i,f[i]]) # [idx, + ]
+			if len(f[s:i]) >= 1 :
+				num= "".join(f[s:i])
+			nums.append(num)
+			s=i+1
+	nums.append("".join(f[ops[-1][0]+1:]))
+	nums= list(map(int, nums))
+	# 연산자 우선순위
+	
+	answer = nums[0]
+	for j in range(len(ops)):
+			if ops[j][1] == "*":
+				answer *= nums[j+1]
+			elif ops[j][1]  == "-":
+				answer -= nums[j+1]
+			elif ops[j][1]  == "+":
+				answer += nums[j+1]
+	return answer 
+	
+
+a,b = input().split()
+out=max(func(a),func(b))
+# print ("Hello Goorm! Your input is " + user_input)
+print(out)