From 915adea135c00f93b597cfc5ea887e0a7eea99fa Mon Sep 17 00:00:00 2001 From: masterMJ Date: Thu, 20 Aug 2026 22:26:20 +0900 Subject: [PATCH 1/3] Create 3992. Rearrange String to Avoid Character Pair.py --- ...arrange String to Avoid Character Pair.py" | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 "leetcode3/\352\271\200\353\257\274\354\240\234/3992. Rearrange String to Avoid Character Pair.py" diff --git "a/leetcode3/\352\271\200\353\257\274\354\240\234/3992. Rearrange String to Avoid Character Pair.py" "b/leetcode3/\352\271\200\353\257\274\354\240\234/3992. Rearrange String to Avoid Character Pair.py" new file mode 100644 index 00000000..5a03991a --- /dev/null +++ "b/leetcode3/\352\271\200\353\257\274\354\240\234/3992. Rearrange String to Avoid Character Pair.py" @@ -0,0 +1,24 @@ +class Solution: + def rearrangeString(self, s: str, x: str, y: str) -> str: + result = [] + x_count = s.count(x)#O(n) + y_count = s.count(y)#O(n) + + if s.find(x) ==-1 or s.find(y) ==-1: #O(n) + result.append(s) + else: + for s1 in s: + if s1 == y: + result.insert(0,s1) #O(n^2) + elif s1 != x: + result.append(s1) + result.insert(y_count,x*x_count) + return ''.join(result) + +s = "zaodvxbsvqstlrbn" +x = "t" +y = "s" +solution = Solution() +print(solution.rearrangeString(s,x,y)) + + From 128eec219630bfa7408cd02dfa6d9d8a37232760 Mon Sep 17 00:00:00 2001 From: masterMJ Date: Thu, 20 Aug 2026 22:26:46 +0900 Subject: [PATCH 2/3] Create 948. Bag of Tokens.py --- .../948. Bag of Tokens.py" | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 "leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" diff --git "a/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" "b/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" new file mode 100644 index 00000000..88828536 --- /dev/null +++ "b/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" @@ -0,0 +1,29 @@ +from typing import List + + +class Solution: + def bagOfTokensScore(self, tokens: List[int], power: int) -> int: + tokens.sort() #Olog(n) + left = 0 #가장 작은 토큰 + right = len(tokens)-1 #가장 큰 토큰 + score = 0 + max_score = 0 + while left <=right:#O(n) + if power >=tokens[left]:#face-up + power -= tokens[left] + score += 1 + left += 1 + max_score = max(max_score,score) + elif score > 0 and left < right:#face-down + power += tokens[right] + score -= 1 + right -= 1 + else: + break + return max_score + + +tokens = [100,200,300,400] +power = 200 +solution = Solution() +print(solution.bagOfTokensScore(tokens,power)) From f1698ea5658ff7eff9672616f3c9dbebcf397576 Mon Sep 17 00:00:00 2001 From: masterMJ Date: Thu, 20 Aug 2026 22:35:09 +0900 Subject: [PATCH 3/3] Update 948. Bag of Tokens.py --- .../\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git "a/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" "b/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" index 88828536..48e74498 100644 --- "a/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" +++ "b/leetcode3/\352\271\200\353\257\274\354\240\234/948. Bag of Tokens.py" @@ -3,7 +3,7 @@ class Solution: def bagOfTokensScore(self, tokens: List[int], power: int) -> int: - tokens.sort() #Olog(n) + tokens.sort() #nlog(n) left = 0 #가장 작은 토큰 right = len(tokens)-1 #가장 큰 토큰 score = 0