Merge pull request #6 from zaqquum/main

Hongjoo/ 3월 3주차 / 4문제

Author: Mingguriguri

Hongjoo/lv1/신고결과받기.py

@@ -0,0 +1,48 @@
+def solution(id_list, report, k):
+    answer = []
+    # output : answer(list)
+    #0 delete duple- suiting apply
+    report_li =[]
+    for n in report : 
+        if n not in report_li:
+            report_li.append(n)
+    #1. report : 1d -> 2d with splite both
+    for i in range(len(report_li)):
+        report_li[i]=report_li[i].split()
+    #2. report : list -> dict
+    v=[]
+    for i in range(len(id_list)):
+        li= []
+        for m in range(len(report_li)):
+            if id_list[i] == report_li[m][0]:
+                li.append(report_li[m][1])
+        v.append(li)
+    dict1 =dict(zip(id_list,v))
+
+    #3. count suiting 
+    count_li = []
+    for i in range(len(id_list)):
+        count=0
+        for values in dict1.values():
+            for m in range(len(values)):  
+                  if id_list[i] == values[m]:
+                    count+=1
+        count_li.append(count)
+    dict2 = dict(zip(id_list,count_li))
+
+
+    # 4. suting list
+    suiting_li = []
+    for suiting,v in dict2.items() :
+        if v >= k:
+            suiting_li.append(suiting)
+    # 5. find the num of suited_id depends on suiting_id 
+    for m,n in dict1.items():
+        count=0
+        for i in range(len(n)):
+            for z in suiting_li:
+                  if z == n[i]:
+                        count +=1
+        answer.append(count)
+
+    return answer

Hongjoo/lv1/컨트롤제트.py

@@ -0,0 +1,18 @@
+def solution(s):
+    answer = 0
+    tmp = []
+    # 1. delete blank and change type spring to list
+    s=s.split() 
+    for i in range(len(s)):
+        # if z exist, then pop all elements in tmp
+        if s[i] == "Z":
+            tmp.pop()
+            continue
+        tmp.append(s[i])
+    # sum about tmp
+    sum = 0
+    for i in range(len(tmp)):
+        sum+= int(tmp[i])
+        print(sum)
+    answer = sum
+    return answer

Hongjoo/lv2/방문길이.py

@@ -0,0 +1,40 @@
+def goTo (start,d): 
+# start : starting poing , d : 1 dirrection
+# output : endpoint []
+    if d == "U": # up
+        end = [start[0], start[1]+1]
+    elif d == "D" : # down
+        end = [start[0], start[1]-1]
+    elif d == "R" :# Right
+        end = [start[0]+1, start[1]]
+    elif d == "L": # Left
+        end = [start[0]-1, start[1]]
+    return  end
+
+def solution(dirs):
+    answer = 0
+    start = [0,0]
+    end =[0,0]
+    allRoot=[[]]
+    # record root about all dirs
+    for d in dirs : 
+        dupli = False
+        end = goTo(start,d)
+            # Find is it exit in map
+        if -5>end[0] or end [0]>5 or -5>end[1] or end [1]>5:
+            continue
+        newroot = [start, end]
+        print("d",d)
+        # Search same root
+        for i in range(len(allRoot)) :
+            if allRoot[i] == [start,end] or allRoot[i] == [end,start] :
+                dupli = True
+                break
+        # update root in allRoot
+        if dupli == False:
+            allRoot.append(newroot)   
+        start= end
+
+    del allRoot[0]
+    answer = len(allRoot)
+    return answer

Hongjoo/lv2/올바른괄호.py

@@ -0,0 +1,28 @@
+def solution(s):
+    answer = True
+    print(s)
+    #1. s은 ( 로 시작, ) 가 끝
+    if s[0] == ")":
+        answer = False
+        return answer
+    elif s[-1] == "(":
+        answer = False
+        return answer
+    #2.) 와 (의 개수 동일
+    left = 0
+    right = 0
+    for n in s : 
+        if n == "(":
+            left +=1 
+        elif n == ")":
+            right +=1
+        else:
+            answer = False
+            return answer 
+    
+    if left != right : 
+        answer = False
+        return answer
+            
+
+    return True