[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
  • ๋„ค์ด๋ฒ„ ๋ธ”๋Ÿฌ๊ทธ ๊ณต์œ ํ•˜๊ธฐ
  • ๋„ค์ด๋ฒ„ ๋ฐด๋“œ์— ๊ณต์œ ํ•˜๊ธฐ
  • ํŽ˜์ด์Šค๋ถ ๊ณต์œ ํ•˜๊ธฐ
  • ์นด์นด์˜ค์Šคํ† ๋ฆฌ ๊ณต์œ ํ•˜๊ธฐ