import java.util.* class Solution { fun solution(tickets: Array): Array { val answer = arrayOf().toMutableList() val answerSet = mutableListOf() val waitingQue = LinkedList() as Queue val defaultItems = mutableListOf() //이것도 안에 넣어야함 tickets.forEachIndexed { index, strings -> if (tickets[index][0] == "ICN") {// 사용안하고, 다음티켓의 시작이 지금티켓의 시작과 같다 defaultItems.add( TicketInfo( tickets[index], 1, Array(t..

var answer = 0 fun solution(begin: String, target: String, words: Array): Int { val wordsArray = words.toMutableList() processing(begin,target,wordsArray,0) println(answer) return answer } fun processing(begin: String, target: String, words: MutableList, count: Int) { if (begin == target) { // 종료 if(answer ==0 || count c != other.get(index) }.map { 1 }.sum() } class Word(val level:Int,val txt:St..

class Solution { var answer = 0 var networkSheet = mutableSetOf() var checkVisit = mutableSetOf() fun solution(n: Int, computers: Array): Int { for (i in 0 until n){ if(!networkSheet.contains(i)){ linking(i,n,computers) answer++ } } println(answer) return answer } fun linking(startP: Int,computersNum:Int,computers: Array){ if (checkVisit.contains(startP)){ return }else{ checkVisit.add(startP) fo..

class Solution { var answer = 0 fun solution(numbers: IntArray, target: Int): Int { an(0,numbers,target,0,"") println(answer) return answer } fun an(count:Int,numbers: IntArray,target: Int,numIncome:Int,string: String){ if(numIncome == target && count == numbers.size){ answer ++ println(string) return } if(count == numbers.size){ return } an(count+1,numbers,target,numIncome+numbers[count],string..

fun solution2(n: Int, costs: Array): Int { var answer = 0 var costsArray = costs.toMutableList() var container = mutableListOf() container.add(0) var count = 0 while (count i[2]) { pair = test.second to i[2] // 바까줌 } } } } container.add(pair.first) answer += pair.second count ++ } println(answer) return answer } fun IntArray.containWj(container : MutableList): Pair { var count = 0 var number = 0..

계속 하나가 시간초과도 나고 더이상의 방법이 생각이 안나서 그냥 다른 사람의 풀이를 봤다.. 일단 나의 풀이 fun solution3(number: String, k: Int): String { var answer = "" val numberArray = number.map { it }.toMutableList() if(numberArray.size == k) return "" for ( i in 1..k){ removing3(numberArray) } for (i in numberArray){ answer+=i } println(numberArray) return answer } fun removing3(intArray: MutableList){ for (i in intArray.indices){ if..