๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Kotlin/Programmers Algorithm

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ์ฝ”ํ‹€๋ฆฐ] ์„œ์šธ์—์„œ ๊น€์„œ๋ฐฉ ์ฐพ๊ธฐ #12919

by eun.24k 2023. 10. 24.

#12919

๐ŸŽ„ Question ?

https://school.programmers.co.kr/learn/courses/30/lessons/12919

class Solution {
    fun solution(seoul: Array<String>): String {
        var answer = ""
        return answer
    }
}

๐Ÿงฉ Thought Process

  1. Kim์ด ์œ„์น˜ํ•œ ์ธ๋ฑ์Šค ์ฐพ๊ธฐ

https://www.baeldung.com/kotlin/array-item-position

@Test
fun `Find index using indexOf`() {
    val numbers = arrayOf(1, 2, 3, 4, 5)
    val elementToFind = 3

    val index = numbers.indexOf(elementToFind)

    assertEquals(2, index)
}

์œ„ ์˜ˆ์ œ๋ฅผ ์ฐธ๊ณ ํ•˜์—ฌ ๋ฌธ์ œ๋ฅผ ํ’€์–ด์•ผ๊ฒ ๋‹ค.

๐ŸŽ€ Answer

class Solution {
    fun solution(seoul: Array<String>): String {
        var answer = ""
        val elementToFind = "Kim"
        val index = seoul.indexOf(elementToFind)
        
        return "๊น€์„œ๋ฐฉ์€ ${index}์— ์žˆ๋‹ค"
    }
}

 

๐ŸŽ Result

 

 

๐Ÿ† Comment

์˜ค๋Š˜์€ ํฐ ์–ด๋ ค์›€์ด ์—†์—ˆ๋˜ ๊ฑฐ ๊ฐ™๋‹ค. ๊ทธ๋ž˜๋„ ๋‹ค๋ฅธ ํ’€์ด ๋ณด๋ฉด์„œ ๋ฐฐ์šด์ ์ด ์žˆ์–ด์„œ ๋‹คํ–‰์ด๋‹ค.