[Day13] Java 13 [8/25]
1. ์ ๋ ฌ
์ ํ์ ๋ ฌ
for (int i = 0; i < 4 ; i++) { // ํ
for (int j = i+1; j <= 4; j++) { // ์ด(๋ณ)
System.out.printf("(%d-%d) ", i, j);
if( m[i] > m[j]) {
int temp = m[i];
m[i] = m[j];
m[j] = temp;
}
}
๊ฐ์ ๋ ์ ํ์ ๋ ฌ
private static void selectionSort(int[] m) {
// i= 0, 1, 2, 3
int minIndex ;
for (int i = 0; i < m.length -1 ; i++) {
minIndex = i;
for (int j = i+1; j < m.length; j++) {
if( m[minIndex] > m[j] ) minIndex= j;
}
if( i != minIndex ) {
int temp = m[i];
m[i] = m[minIndex];
m[minIndex] = temp;
}
}
}
2. ์ธ๋ฑ์ค ์ฐพ๊ธฐ
public static void main(String[] args) {
String message = "์๋
ํ์ธ์. ํ๊ธธ๋์
๋๋ค. ํ๊ธธ๋์
๋๋ค. ํ๊ธธ๋์
๋๋ค.";
//int searchIndex = message.indexOf("์ด์ฐฝ์ต");
//System.out.println( searchIndex ); // 7, -1
int startIndex = 0;
int searchIndex = -1;
while( ( searchIndex = message.indexOf("ํ๊ธธ๋", startIndex)) != -1 ) {
System.out.println( searchIndex );
startIndex = searchIndex + 1;
}
} // main
'๐จโ๐ป Web Development > Java' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[Day15] Java 15 - ์ ๊ทผ ์ง์ ์, ํด๋์ค (๋ณ์, ๋ฉ์๋ ๋ฑ) (0) | 2022.09.07 |
---|---|
[Day14] Java 14 - N์ฐจ์ ๋ฐฐ์ด ์ฑ์๋ฃ๊ธฐ, OOP ๊ธฐ๋ณธ (0) | 2022.09.06 |
[Day12] Java 12 - ๋ฐฐ์ด์ ํ์ฉ (0) | 2022.09.01 |
[Day11] Java 11 - ๋ฌ๋ ฅ์ถ๋ ฅ, ๋ฐฐ์ด, N์ฐจ์ ๋ฐฐ์ด (0) | 2022.09.01 |
[Day10] Java 10 - ์ง์ ๋ณํ (0) | 2022.09.01 |
์ต๊ทผ๋๊ธ