Skip to content

Commit 3c6d115

Browse files
Merge pull request #1810 from CodingTestStudy2/남효정
[남효정] Day13
2 parents 96a139d + 5bdf394 commit 3c6d115

2 files changed

Lines changed: 36 additions & 0 deletions

File tree

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
class Solution:
2+
def residuePrefixes(self, s: str) -> int:
3+
ans = 0
4+
check = set()
5+
6+
for i, char in enumerate(s):
7+
check.add(char)
8+
9+
# 종류가 3가지 이상이 되면 더 계산할 필요 없음
10+
if len(check) >= 3:
11+
break
12+
13+
# 문제에서 원하는 조건 만족할 때마다 정답 개수 += 1
14+
if len(check) == (i + 1) % 3:
15+
ans += 1
16+
return ans
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# 풀이 실패
2+
class Solution:
3+
def new21Game(self, n: int, k: int, maxPts: int) -> float:
4+
if k == 0 or n >= k + maxPts:
5+
return 1.0
6+
7+
dp = [0.0] * (n + 1)
8+
dp[0] = 1.0
9+
window_sum = 1.0
10+
11+
for i in range(1, n+1):
12+
dp[i] = window_sum / maxPts
13+
14+
if i < k:
15+
window_sum += dp[i]
16+
17+
if i >= maxPts and (i - maxPts) < k:
18+
window_sum -= dp[i - maxPts]
19+
20+
return sum(dp[k:])

0 commit comments

Comments
 (0)