Notice
Recent Posts
Recent Comments
Link
250x250
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
31 |
Tags
- boto3
- Resolver
- 외국납부세액공제
- 산지연금
- 신탁공매
- 정책자금
- 양도소득세
- AWS
- 경매
- 성능개선
- serverless
- 리소스
- pod
- python
- command
- Kubernetes
- 농지연금
- 임업후계자
- node
- 매입불공제
- route53
- kubectl
- 세금계산서
- lambda
- Filter
- OpenSearch
- 공매
- S3
- 금융소득
- 인덱싱
Archives
- Today
- Total
진지한 개발자
String Matching in an Array 본문
728x90
Given an array of string words, return all strings in words that are a substring of another word. You can return the answer in any order.
Example 1:
Input: words = ["mass","as","hero","superhero"]
Output: ["as","hero"]
Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
["hero","as"] is also a valid answer.
Example 2:
Input: words = ["leetcode","et","code"]
Output: ["et","code"]
Explanation: "et", "code" are substring of "leetcode".
Example 3:
Input: words = ["blue","green","bu"]
Output: []
Explanation: No string of words is substring of another string.
Solution
class Solution:
def stringMatching(self, words: List[str]) -> List[str]:
words.sort(key=len)
answer = []
for i in range(len(words)):
for j in range(i+1, len(words)):
if words[i] in words[j]:
answer.append(words[i])
break
return answer
728x90