일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- hackerrank
- 백준
- dacon
- ChatGPT
- Real or Not? NLP with Disaster Tweets
- gs25
- 코로나19
- 맥북
- Baekjoon
- 편스토랑 우승상품
- 캐치카페
- 프로그래머스
- 파이썬
- leetcode
- Git
- 프로그래머스 파이썬
- 자연어처리
- ubuntu
- PYTHON
- github
- Kaggle
- 금융문자분석경진대회
- 더현대서울 맛집
- 데이콘
- SW Expert Academy
- 편스토랑
- Docker
- AI 경진대회
- programmers
- 우분투
- Today
- Total
목록
반응형
2020/08/02 (2)
솜씨좋은장씨
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the string does not contain any non-printable characters. Example: Input: "Hello, my name is John" Output: 5 Solution class Solution: def countSegments(self, s: str) -> int: answer = len(s.split()) return answer SOMJANG/CODINGTEST_PRACTICE 1일 1문제 since 2020.0..
Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. Example 1: Input: s = "codeleet", indices = [4,5,6,7,0,2,1,3] Output: "leetcode" Explanation: As shown, "codeleet" becomes "leetcode" after shuffling. Example 2: Input: s = "abc", indice..