๐ Algorithm/etc
์๋ฐ(Java) - ๋ก๋ ๋ฒํธ ์์ฑ
kongmi
2023. 1. 7. 19:19
1 ~ 45 ์ฌ์ด์ ์์์ ์ซ์ 6๊ฐ๋ก ๊ตฌ์ฑ
<๋ฏธ์ >
(1) ๋ฐฐ์ด๋ก ๋ก๋ ๋ฒํธ ์์ฑ ํ ์ถ๋ ฅ
(2) ๋ฐฐ์ด๋ก ๋ก๋ ๋ฒํธ ์์ฑ(์ค๋ณต ์ ๊ฑฐ)
(3) ๋ค๋ฅธ ์๋ฃ๊ตฌ์กฐ๋ก ์์ฑํด๋ณด๊ธฐ(ArrayList, Set)
์ฒซ ๋ฒ์งธ
package ๋ฐฐ์ด๋ณต์ต;
import java.util.Arrays;
public class ArrReview {
public static void main(String[] args) {
int[] lottoNum = new int[6]; //๋ก๋ ๋ฒํธ ๋ด์ ๋ฐฐ์ด ์์ฑ(ํฌ๊ธฐ:6)
int tmp; // ๋์ ์์ฑ์ ์ ์ฅํ ์์๊ณต๊ฐ
boolean isExist = false; // ์ค๋ณต ์ฒดํฌ์ ์ฌ์ฉ
int index = 0;
while (true) {
tmp = (int) ((Math.random() * 45) + 1); // 1~45 ์ฌ์ด ๋์ ๋ฐ์
for (int i = 0; i < lottoNum.length; i++) {
if (lottoNum[i] == tmp) isExist = true; // ๋ฐฐ์ด์ ์์ฑ๋ ๋ฒํธ๊ฐ ์์ผ๋ฉด true
}
if (isExist == false) lottoNum[index++] = tmp; // ๋ฐฐ์ด์ ์์ฑ๋ ๋ฒํธ ์์ผ๋ฉด ์ ์ฅ
if (index == lottoNum.length) break; // 6๊ฐ ๋ง๋ค์ด์ง๋ฉด ํ์ถ
isExist = false;
}
System.out.println(Arrays.toString(lottoNum));
}
}
๋ ๋ฒ์งธ(ArrayList)
package ๋ฐฐ์ด๋ณต์ต;
import java.util.ArrayList;
import java.util.List;
public class ArrReview {
public static void main(String[] args) {
List<Integer> lottoNum = new ArrayList<>();
int tmp;
while (true) {
tmp = (int) ((Math.random() * 45) + 1);
if (!lottoNum.contains(tmp)) lottoNum.add(tmp);
if (lottoNum.size() == 6) break;
}
for(Integer e : lottoNum) System.out.println(e + " ");
}
}
์ธ ๋ฒ์งธ(Set)
package ๋ฐฐ์ด๋ณต์ต;
import java.util.HashSet;
public class ArrReview {
public static void main(String[] args) {
HashSet<Integer> lottoNum = new HashSet<>();
while(true) {
int tmp = (int)((Math.random() * 45) + 1);
lottoNum.add(tmp);
if(lottoNum.size() == 6) break;
}
System.out.println(lottoNum);
}
}
* Set ๊ฐ์ฒด๋ ์ค๋ณต์ ํ์ฉํ์ง ์๋ ๊ฐ์ฒด์ด๊ธฐ ๋๋ฌธ์ ๋ณ๋์ ์ค๋ณต์ ๊ฑฐ๋ ํ์ง ์์๋ ๋๋ค.