-
Notifications
You must be signed in to change notification settings - Fork 0
/
체육복.py
91 lines (63 loc) · 1.67 KB
/
체육복.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
# -*- coding: utf-8 -*-
"""
Created on Mon Nov 1 16:05:19 2021
@author: user
"""
#프로그래머스 level 01
#greedy
#체육복
n = 10
lost = [2, 4,6,8]
reserve = [1, 3, 5,8]
#첫 시도 - 3개 케이스 실패
def solution(n, lost, reserve):
answer = 0
lost_len = len(lost)
for i in lost :
if i in reserve :
reserve.remove(i)
lost.remove(i)
lost_len -= 1
for i in lost :
if (i-1) in reserve :
reserve.remove(i-1)
lost_len -= 1
elif (i+1) in reserve :
reserve.remove(i+1)
lost_len -= 1
answer = n - lost_len
return answer
print(solution(n, lost, reserve))
#%%
#두번째 시도 - 2개 케이스 실패
def solution(n, lost, reserve):
answer = 0
lost_len = len(lost)
lost_copy = lost[:]
for i in lost_copy :
if i in reserve :
reserve.remove(i)
lost.remove(i)
lost_len -= 1
for i in reserve :
if (i-1) in lost :
lost.remove(i-1)
lost_len -= 1
elif (i+1) in lost :
lost.remove(i+1)
lost_len -= 1
answer = n - lost_len
return answer
#%%
#다른 사람 풀이
def solution(n, lost, reserve):
answer = 0
reserve_del = set(reserve)-set(lost)
lost_del = set(lost)-set(reserve)
for i in reserve_del:
if i-1 in lost_del:
lost_del.remove(i-1)
elif i+1 in lost_del:
lost_del.remove(i+1)
answer = n - len(lost_del)
return answer