์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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
- MySQL
- From Machine Reading Comprehension to Dialogue State Tracking: Bridging the Gap
- Few Shot Dialogue State Tracking using Meta-learning
- dialogue state tracking
- Python
- ํ์ด์ฌ์ ํ์ด์ฌ๋ต๊ฒ
- How Much Knowledge Can You Pack Into the Parameters of a Language Model?
- ํ๋ก๊ทธ๋๋จธ์ค
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ ์์ ๋น
- til
- SUMBT:Slot-Utterance Matching for Universal and Scalable Belief Tracking
- few shot dst
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ์ ๊ณต์
- ๋ค์ด๋๋ฏน ํ๋ก๊ทธ๋๋ฐ
- ๋ฐฑ์ค
- fasttext text classification ํ๊ธ
- ๋ฅ๋ฌ๋๊ธฐ์ด
- Zero-shot transfer learning with synthesized data for multi-domain dialogue state tracking
- ์์ฐ์ด์ฒ๋ฆฌ ๋ ผ๋ฌธ ๋ฆฌ๋ทฐ
- DST zeroshot learning
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ ์ฑ ์ถ์ฒ
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ์ ๊ณต์ํฉ๊ฒฉํ๊ธฐ
- DST fewshot learning
- classification text
- 2020์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌํ๊ธฐ
- nlp๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- ๋ชจ๋์๋ฅ๋ฌ๋
- ๋ฐ์ดํฐ ํฉ์ฑ
- Leveraging Slot Descriptions for Zero-Shot Cross-Domain Dialogue State Tracking
- ๊ฒ์์์ง
Archives
- Today
- Total
๐ฒ์๋ผ๋๋์ฒญ๋
[ํ๋ก๊ทธ๋๋จธ์ค] ๋ชจ์๊ณ ์ฌ (java) ๋ณธ๋ฌธ
๋ฐ์ํ
๋ฌธ์ : https://programmers.co.kr/learn/courses/30/lessons/42840
๋ฑํ ์ ํผ๊ฒ ๊ฐ์ง ์๋ค. ๊ทธ๋ฅ ํ์๋ค
๋์ ์ฝ๋ :
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
47
48
49
50
51
52
53
54
55
|
import java.util.*;
class Solution {
int [] p1;
int [] p2;
int [] p3;
public int[] solution(int[] answers) {
p1 = new int[]{1,2,3,4,5};//5
p2 = new int[]{2,1,2,3,2,4,2,5};//8
p3 = new int[]{3,3,1,1,2,2,4,4,5,5};//10
int a1=0;
int a2=0;
int a3=0;
for(int i=0; i<answers.length; i++){
int tmp1 = i%5;
if(answers[i] == p1[tmp1]) a1++;
int tmp2 = i%8;
if(answers[i] == p2[tmp2]) a2++;
int tmp3 = i%10;
if(answers[i] == p3[tmp3]) a3++;
}
//find max
int max = a1;
if(a1<a2){
max = a2;
}
if(max<a3){
max = a3;
}
ArrayList<Integer> correct= new ArrayList<>();
if(a1==max) correct.add(1);
if(a2==max) correct.add(2);
if(a3==max) correct.add(3);
Collections.sort(correct);
int [] answer = new int[correct.size()];
for(int i=0; i<correct.size(); i++){
answer[i] = correct.get(i);
}
return answer;
}
}
|
cs |
arraylist๋ฅผ array๋ก ๋ง๋ค ๋,to.Array๊ฐ ์ ๋จนํ์ง ์์๋ค.
์กฐ๊ธ ๊ท์ฐฎ๋๋ผ๋, array๋ฅผ ์์ฑํ ๋ค, ๊ฐ์ ํ๋ํ๋ ๋ฃ์ด์ฃผ๋ ๋ฐฉ์์ผ๋ก ํ์๋ค.
3๋ช ๋ง ๋น๊ตํ๋ฉด ๋๋ ๋ฌธ์ ๋ผ ๋ฐฐ์ด์ ์ฌ์ฉํ์ง ์์๋๋ฐ, 3๋ช ์ด์์ด๋ผ๋ฉด ๊ผญ ๋ฒ ์ด์ ์ฌ์ฉํด์ผ ํ๋ ๋ฌธ์ ์๋ค.
arrayList๋ length()๊ฐ ์๋๊ณ size() ๋ก ๊ธธ์ด๋ฅผ ๊ตฌํด์ผํ๊ณ , put()์ด ์๋๋ผ add()๋ฅผ ์ฌ์ฉํด์ ๋ฆฌ์คํธ์ ์ถ๊ฐํด์ผ ํ๋ค๋์ ์ด ํท๊ฐ๋ ธ๋ค.
๋ฐ์ํ