1+ """
2+ 1 - R,T
3+ 2 - C,F
4+ 3,- J , M
5+ 4 - A, N
6+
7+ => 7 : +3N , 6 : +2N , 5 : +1N 4: 0 , 3 : +A , 2: +2A , 1 : + 3A (๋น๋์)
8+ """
9+
10+ def solution (survey , choices ):
11+ answer = ''
12+ vote = list ()
13+ for i in range (len (survey )) :
14+ a = survey [i ][0 ] ; b = survey [i ][1 ] # ๋น๋์ , ๋์
15+ target = ''
16+ tmp = choices [i ]- 4
17+
18+ if tmp > 0 : # ์์ -> ๋์
19+ target = b
20+ elif tmp < 0 : # ์์ -> ๋น๋์
21+ target = a
22+ tmp = tmp * (- 1 )
23+ else : # tmp == 0
24+ continue
25+
26+ # vote์ ์ฌ๋ถ ํ์ธ
27+ if len (vote ) == 0 : # ์ด๊ธฐํ
28+ vote .append ([target ,tmp ])
29+ continue
30+ for k in range (len (vote )) :
31+ if vote [k ][0 ] == target : # ์์ผ๋ฉด -> ๋ํ๊ธฐ
32+ vote [k ][1 ] += tmp
33+ break
34+ if k >= len (vote )- 1 :
35+ # ์์ผ๋ฉด -> ์
๋ฐ์ดํธ
36+ vote .append ([target ,tmp ])
37+
38+ answer_list = [0 ,0 ,0 ,0 ]
39+ twin = [["R" ,"C" ,"J" ,"A" ] ,["T" , "F" , "M" , "N" ]]
40+ for k in range (len (vote )) :
41+ if vote [k ][0 ] in twin [0 ]: # ์์
42+ answer_list [twin [0 ].index (vote [k ][0 ])]-= vote [k ][1 ]
43+ elif vote [k ][0 ] in twin [1 ]: # ์์
44+ answer_list [twin [1 ].index (vote [k ][0 ])] += vote [k ][1 ]
45+
46+
47+ for j in range (len (answer_list )):
48+ if answer_list [j ] > 0 :# ์์
49+ answer += twin [1 ][j ]
50+ else :# ์์
51+ answer += twin [0 ][j ]
52+
53+ return answer
0 commit comments