[PGS]방문길이/lv2/40min

Author: zaqquum

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

@@ -0,0 +1,18 @@
+def solution(s):
+    answer = 0
+    tmp = []
+    # 1. delete blank in string by using Replace()
+    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/lv1/컨트롤제트.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