반응형
Notice
Recent Posts
Recent Comments
Link
목록1157 (1)
안경잡이 구루루
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/64UU6/btqFoBzr55I/4BpOt7nTdAC06IFj0pwMM1/img.png)
https://www.acmicpc.net/problem/1157 나: word = input() ws = word.lower() a = sorted(set(ws)) alpha= [] high = 0 ouput = 0 for i in a: if ws.count(i) >= high: high = ws.count(i) alpha.append(high) output = i else: pass if alpha.count(max(alpha)) >= 2: print('?') else: print(output.upper()) 완성된 코드는 위와 같다. word = input() ws = word.lower() a = sorted(set(ws)) alpha= [] high = 0 ouput = 0 대소문자로 이루어진 ..
파이썬(Python)/문제풀이(백준,BaekJoon)
2020. 7. 4. 11:23