Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- hackerrank
- 편스토랑
- Git
- programmers
- dacon
- 프로그래머스 파이썬
- 코로나19
- PYTHON
- SW Expert Academy
- ChatGPT
- Real or Not? NLP with Disaster Tweets
- 캐치카페
- Kaggle
- 금융문자분석경진대회
- Baekjoon
- 프로그래머스
- 데이콘
- 우분투
- AI 경진대회
- leetcode
- Docker
- 자연어처리
- github
- 편스토랑 우승상품
- 더현대서울 맛집
- ubuntu
- 백준
- 맥북
- gs25
- 파이썬
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 791. Custom Sort String (Python) 본문
728x90
반응형
S and T are strings composed of lowercase letters. In S, no letter occurs more than once.
S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.
Return any permutation of T (as a string) that satisfies this property.
Example :
Input:
S = "cba"
T = "abcd"
Output: "cbad"
Explanation:
"a", "b", "c" appear in S, so the order of "a", "b", "c" should be "c", "b", and "a".
Since "d" does not appear in S, it can be at any position in T. "dcba", "cdba", "cbda" are also valid outputs.
Note:
- S has length at most 26, and no character is repeated in S.
- T has length at most 200.
- S and T consist of lowercase letters only.
Solution
class Solution:
def customSortString(self, S: str, T: str) -> str:
answer_list = ""
for s in S:
if s in T:
answer_list += s*T.count(s)
for t in T:
if t not in S:
answer_list += t
return answer_list
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 492. Construct the Rectangle (Python) (0) | 2021.01.13 |
---|---|
[leetCode] 461. Hamming Distance (Python) (0) | 2021.01.12 |
[leetCode] 821. Shortest Distance to a Character (Python) (0) | 2021.01.08 |
[leetCode] 1619. Mean of Array After Removing Some Elements (Python) (0) | 2021.01.01 |
[leetCode] 1290. Convert Binary Number in a Linked List to Integer (Python) (0) | 2020.12.31 |
Comments