updatE

Author: dlgosla

week14/haenim/로봇 청소기.py

@@ -0,0 +1,58 @@
+"""
+빈칸 0 벽 1
+바라보는 방향: 0 북, 1 동, 2 남, 3 서
+
+
+"""
+
+
+
+def solution():
+    count = 1
+    n, m = map(int, input().split())
+    x, y, d = map(int, input().split())
+    board = [list(map(int, input().split())) for _ in range(n)]
+
+    board[x][y] =  2 #현재 위치 청소
+
+    dx, dy = [-1,0,1,0], [0,1,0,-1]
+    
+    while True:
+        fail = True
+
+        for i in range(4):
+           
+            nd = (d+3)%4 # 다음 방향
+            nx,ny = x + dx[nd], y + dy[nd] #그 방향으로 이동
+            d = nd
+
+            if nx >= n or ny >= m:
+                continue
+                
+            
+            elif board[nx][ny] == 0 : #빈칸이면
+                board[nx][ny] = 2 #청소
+                x,y = nx,ny
+                count += 1
+                fail = False
+                break
+
+
+        # 네 방향 모두 청소 못했으면
+        if fail == True:
+            nd = (d + 2) % 4 #후진
+            nx,ny = x + dx[nd], y + dy[nd]
+
+            if nx >= n or ny >= m or board[nx][ny] == 1:
+                return count
+            
+            else :
+                x,y = nx, ny
+                
+    return count
+
+print(solution())
+        
+
+
+

week14/haenim/보석 쇼핑.py

@@ -0,0 +1,55 @@
+"""
+정확도 33.3
+효율성 13.3
+
+"""
+
+def solution(gems):
+    answer = []
+
+    gems_set = set(gems)
+
+    len_gems_set = len(gems_set)
+
+    minimum = 1000000
+
+    value = [0]*len_gems_set
+    gems_dict = dict(zip(gems_set,value))
+
+    print(gems_dict)
+
+    start = 0
+    end = 0
+
+    while end < len(gems):
+        temp = gems[start:end+1]
+        gems_dict[gems[end]] += 1
+
+        
+        end += 1
+        
+        if len_gems_set == len(set(temp)):
+
+            while start < end :
+                if gems_dict[gems[start]] > 1 :
+                    gems_dict[gems[start]] -= 1
+                    
+                    start += 1
+                    
+                elif minimum > end - start:
+                    minimum = end - start
+                    answer = [start+1, end]
+                    
+                    break
+                
+                else:
+                    break
+                
+
+        
+    
+    return answer
+
+
+print(solution(["DIA", "RUBY", "RUBY", "DIA", "DIA",
+                "EMERALD", "SAPPHIRE", "DIA"]))

week14/haenim/보석 쇼핑_효율성100.py

@@ -0,0 +1,56 @@
+"""
+정확도 33.3
+효율성 66.7
+
+
+"""
+
+def solution(gems):
+    answer = []
+
+    gems_set = set(gems)
+
+    len_gems_set = len(gems_set)
+
+    minimum = 1000000
+
+    gems_dict = {}
+
+
+    start = 0
+    end = 0
+
+    while end < len(gems):
+        if gems[end] not in gems_dict:
+            gems_dict[gems[end]] = 1
+        else :
+            gems_dict[gems[end]] += 1
+
+        
+        end += 1
+        
+        if len_gems_set == len(gems_dict):
+
+            while start < end :
+                if gems_dict[gems[start]] > 1 :
+                    gems_dict[gems[start]] -= 1
+                    
+                    start += 1
+                    
+                elif minimum > end - start:
+                    minimum = end - start
+                    answer = [start+1, end]
+                    
+                    break
+                
+                else:
+                    break
+                
+
+        
+    
+    return answer
+
+
+print(solution(["DIA", "RUBY", "RUBY", "DIA", "DIA",
+                "EMERALD", "SAPPHIRE", "DIA"]))

week14/haenim/순위검색.py

@@ -0,0 +1,48 @@
+def solution(info, query):
+    #info : 지원자 정보
+    #query : 조건
+    # [조건]을 만족하는 사람 중 코딩테스트 점수를 X점 이상 받은 사람은 모두 몇 명인가?
+    
+    answer = []
+    
+
+    #쿼리 개수 만큼 반복
+    for i in range(len(query)):
+        count = 0
+
+        # java and backend and junior and pizza 100 = > ['java', 'backend', 'junior', 'pizza', '100']
+        q = query[i].split(" and ")
+        last = q[-1].split(" ")
+        q.pop()
+        q = q + last
+
+
+        # 각 유저에 대해서
+        for data in info:
+            for j in range(len(q)):
+                #이 쿼리의 모든 조건을 만족하면 count를 늘림
+                if j == 4:
+                    if int(q[j]) <= int(data.split()[-1]):
+                        count += 1
+                    
+                if q[j] == "-":
+                    continue
+
+                # 하나라도 조건에 안맞는 유저면 버림
+                elif j != 4 and data.find(q[j]) == -1:
+                    break
+
+
+        
+                        
+        answer.append(count)
+        
+    
+    return answer
+
+
+print(solution(["java backend junior pizza 150", "python frontend senior chicken 210", "python frontend senior chicken 150",
+          "cpp backend senior pizza 260", "java backend junior chicken 80", "python backend senior chicken 50"],
+         ["java and backend and junior and pizza 100", "python and frontend and senior and chicken 200",
+          "cpp and - and senior and pizza 250", "- and backend and senior and - 150", "- and - and - and chicken 100",
+          "- and - and - and - 150"]))