일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- UBAR: Towards Fully End-to-End Task-Oriented Dialog System with GPT-2
- ImageNet Classification with Deep ConvolutionalNeural Networks 리뷰
- Evaluate Multiwoz
- NLP 논문 리뷰
- A Neural Attention Model for Abstractive Sentence Summarization
- Zero-shot Generalization in Dialog State Tracking through GenerativeQuestion Answering
- BART 논문리뷰
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 논문리뷰
- Multi Task Learning Objectives for Natural Language Processing 리뷰
- 길찾기
- attention 설명
- RuntimeError: DataLoader worker (pid(s) ) exited unexpectedly
- The Natural Language Decathlon:Multitask Learning as Question Answering
- MMTOD
- 뉴텝스 400
- CNN 논문리뷰
- Attention Is All You Need
- Attention Is All You Need 리뷰
- 바닥부터 배우는 강화 학습
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer 리뷰
- T5 논문 리뷰
- hugging face tokenizer에서 special case 추가하기
- 정책기반 agent
- BERT란
- 다양한 모듈에서 log쓰기
- Multi Task Learning Objectives for Natural Language Processing
- BERT 사용방법
- TOD 논문리뷰
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 리뷰
Archives
- Today
- Total
one by one ◼◻◼◻
신규 아이디 추천 (2021 KAKAO BLIND RECRUITMENT) 본문
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
def solution(new_id):
allow = list('abcdefghijklmnopqrstuvwxyz-_.1234567890')
new_id = new_id.lower()
print(new_id)
step_2= []
for c in new_id:
if c in allow:
step_2.append(c)
new_id = ''.join(step_2)
print(new_id)
step_3 = []
continue_flag = False
for c in new_id:
if c != '.':
step_3.append(c)
continue_flag = False
if c == '.':
if continue_flag == False:
step_3.append(c)
continue_flag = True
new_id = ''.join(step_3)
print(new_id)
while len(new_id) >=1 and new_id[0] == '.':
if len(new_id) == 1:
new_id = ''
break
else:new_id = new_id[1:]
while len(new_id) >=1 and new_id[-1] == '.' :
if len(new_id) == 1:
new_id = ''
break
new_id = new_id[:-1]
if len(new_id) == 0 : new_id = 'a'
if len(new_id) >=16:
new_id = new_id[:15]
if new_id[-1] == '.' :new_id = new_id[:-1]
while len(new_id) <=2:
new_id = new_id + new_id[-1]
print(new_id)
return new_id
|
cs |
'코딩문제' 카테고리의 다른 글
위장 (프로그래머스 코딩테스트 연습-해시) (0) | 2022.06.10 |
---|---|
숫자 문자열과 영단어 (2021 카카오 채용연계형 인턴십) (0) | 2022.06.08 |
로또의 최고 순위와 최저 순위 (2021 Dev-Matching: 웹 백엔드 개발자(상반기) (0) | 2022.06.06 |
신고 결과 받기 (2022 KAKAO BLIND RECRUITMENT) (0) | 2022.06.06 |
[queue]프로그래머스-기능개발 (0) | 2022.01.22 |
Comments