fun Collection.powerset(): Set = powerset(this, setOf(setOf())) private tailrec fun powerset(left: Collection, acc: Set): Set = when { left.isEmpty() -> acc else ->powerset(left.drop(1), acc + acc.map { it + left.first() }) } fun main() { val list1 = listOf(1,2,3,4,5,6,7,8) val list2 = listOf(1,2,3) val a = list1.powerset() println(a) println(a.size) val b = list2.powerset() println(b) } github...
fun solution(str1: String, str2: String) : Int { val ALTHA = 65536 val regex = Regex("[a-zA-Z][a-zA-Z]") var union = 0 var intersection = 0 val str1List = str1.toList().windowed(2).mapNotNull{ list -> var newStr : String = String(list.toCharArray()).toLowerCase() if(regex.matches(newStr)) newStr else null } val str2List = str2.toList().windowed(2).mapNotNull{ list -> var newStr : String = String..
ํ์ฌ์ฝ๋ ์ฐธ๊ณ sooooooyn.tistory.com/32 [2020์นด์นด์ค๊ณต์ฑ] ๊ธฐ๋ฅ๊ณผ ๋ณด ์ค์น https://programmers.co.kr/learn/courses/30/lessons/60061 ํ๋ก๊ทธ๋๋จธ์ค ์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์ ๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์ sooooooyn.tistory.com class Solution { var SIZE = -1 var pillers = mutableListOf(mutableListOf()) var beams = mutableListOf(mutableListOf()) enum class BuildOrder() { PILLER_CONSTRUCT, PILLER_DESTRUCT, BEA..