kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/candies/MinimumPasses.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.search.candies
import java.math.BigDecimal
import java.math.BigDecimal.ONE
import java.math.BigDecimal.ZERO
import java.math.BigDecimal.valueOf
import java.math.RoundingMode.CEILING
import java.math.RoundingMode.FLOOR
import java.util.*
fun minimumPass... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/candies/MinimumPassesKt.class",
"javap": "Compiled from \"MinimumPasses.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.search.candies.MinimumPassesKt {\n... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/swap/SwapNodes.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.search.swap
import java.util.*
fun swapNodes(indexes: Array<Array<Int>>, queries: Array<Int>): List<List<Int>> {
val root = buildTree(indexes)
return queries.map { swapMultiplier ->
val queryResult = mutableListOf<Int>()
traver... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/swap/SwapNodesKt.class",
"javap": "Compiled from \"SwapNodes.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.search.swap.SwapNodesKt {\n public static fi... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/triplets/Triplets.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.search.triplets
import java.util.*
fun triplets(a: IntArray, b: IntArray, c: IntArray): Long {
val (aSorted, aSize) = sortUniqueToSize(a)
val (bSorted, bSize) = sortUniqueToSize(b)
val (cSorted, cSize) = sortUniqueToSize(c)
val totalS... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/triplets/TripletsKt.class",
"javap": "Compiled from \"Triplets.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.search.triplets.TripletsKt {\n public stat... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/minTime/MinTime.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.search.minTime
import java.util.*
import kotlin.math.ceil
import kotlin.math.floor
fun minTime(machines: List<Int>, goal: Int): Long {
fun producedByMachinesIn(time: Long): Long =
machines.fold(0L) { total, machine -> total + time / machine... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/search/minTime/MinTimeKt.class",
"javap": "Compiled from \"MinTime.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.search.minTime.MinTimeKt {\n public static fi... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/greedy/luck/LuckBalance.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.greedy.luck
import java.lang.IllegalArgumentException
import java.util.*
fun luckBalance(k: Int, contests: List<Contest>): Int {
val (importantContests, unimportanceContests) =
contests.partition { it.importance == Importance.IMPORTANT }
... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/greedy/luck/LuckBalanceKt$luckBalance$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.greedy.lu... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/sorting/merge/CountInversions.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.sorting.merge
import java.util.*
fun countInversions(arr: IntArray): Long =
mergeSortSupport(arr, IntArray(arr.size), 0, arr.size)
fun mergeSortSupport(arr: IntArray, temp: IntArray, left: Int, right: Int): Long =
if (right - left > 1) {
... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/sorting/merge/CountInversionsKt.class",
"javap": "Compiled from \"CountInversions.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.sorting.merge.CountInversionsKt... |
slobanov__kotlin-hackerrank__2cfdf85/src/main/kotlin/ru/amai/study/hackerrank/practice/interviewPreparationKit/sorting/fraud/ActivityNotifications.kt | package ru.amai.study.hackerrank.practice.interviewPreparationKit.sorting.fraud
import java.util.*
private const val MAX_EXPENDITURE = 201
fun activityNotifications(expenditure: IntArray, d: Int): Int {
val counts = buildCounts(expenditure, d)
return (d until expenditure.size).count { i ->
val media... | [
{
"class_path": "slobanov__kotlin-hackerrank__2cfdf85/ru/amai/study/hackerrank/practice/interviewPreparationKit/sorting/fraud/ActivityNotificationsKt.class",
"javap": "Compiled from \"ActivityNotifications.kt\"\npublic final class ru.amai.study.hackerrank.practice.interviewPreparationKit.sorting.fraud.Activ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P86052.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/409
class P86052 {
companion object {
const val UP = 0
const val RIGHT = 1
const val DOWN = 2
const val LEFT = 3
}
fun solution(grid: Array<String>): IntArray {
// 각 격자에서 네방향으로 이동한 기록
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P86052$Companion.class",
"javap": "Compiled from \"P86052.kt\"\npublic final class kr.co.programmers.P86052$Companion {\n private kr.co.programmers.P86052$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P12952.kt | package kr.co.programmers
import kotlin.math.abs
// https://github.com/antop-dev/algorithm/issues/535
class P12952 {
fun solution(n: Int): Int {
return dfs(IntArray(n), 0)
}
private fun dfs(arr: IntArray, row: Int): Int {
if (row == arr.size) { // n번째 행까지 퀸을 다 놓았다.
return 1
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P12952.class",
"javap": "Compiled from \"P12952.kt\"\npublic final class kr.co.programmers.P12952 {\n public kr.co.programmers.P12952();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P67258.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/455
class P67258 {
fun solution(gems: Array<String>): IntArray {
// ["AA", "AB", "AC", "AA", "AC"]
// [ 0, 1, 2, 0, 2 ]
val map = mutableMapOf<String, Int>()
val list = mutableListOf<Int>()
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P67258.class",
"javap": "Compiled from \"P67258.kt\"\npublic final class kr.co.programmers.P67258 {\n public kr.co.programmers.P67258();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P68936.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/240
class P68936 {
fun solution(arr: Array<IntArray>): IntArray {
return recursive(arr, 0, 0, arr.size)
}
private fun recursive(arr: Array<IntArray>, y: Int, x: Int, size: Int): IntArray {
val count = intArrayOf(0,... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P68936.class",
"javap": "Compiled from \"P68936.kt\"\npublic final class kr.co.programmers.P68936 {\n public kr.co.programmers.P68936();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P150368.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/488
class P150368 {
fun solution(users: Array<IntArray>, emoticons: IntArray): IntArray {
val answer = intArrayOf(0, 0)
// 모든 조합으로 구매를 계산한다.
val combinations = combinations(emoticons.size)
for (comb in combin... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P150368.class",
"javap": "Compiled from \"P150368.kt\"\npublic final class kr.co.programmers.P150368 {\n public kr.co.programmers.P150368();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P42861.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/530
class P42861 {
fun solution(n: Int, costs: Array<IntArray>): Int {
// 건설 비용이 낮은 순으로 정렬
costs.sortBy { (_, _, cost) -> cost }
// Union-Find
val root = IntArray(n) { it }
var ans = 0
var co... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P42861.class",
"javap": "Compiled from \"P42861.kt\"\npublic final class kr.co.programmers.P42861 {\n public kr.co.programmers.P42861();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P172927.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/481
class P172927 {
fun solution(picks: IntArray, minerals: Array<String>): Int {
// 곡괭이의 수만큼 5칸마다 구간의 합(가중치)을 구한다.
val mines = mutableListOf<IntArray>()
var numOfPick = picks[0] + picks[1] + picks[2]
for (i... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P172927$solution$$inlined$sortByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class kr.co.programmers.P172927$solution$$inlined$sortByDescending$1<T> implements java.util.Comparator {\n public kr.co.programmers... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P155651.kt | package kr.co.programmers
import java.util.*
// https://github.com/antop-dev/algorithm/issues/489
class P155651 {
fun solution(bookTime: Array<Array<String>>): Int {
// 입(퇴)실 시간으로 정렬
// 시간이 같다면 퇴실 시간이 먼저다.
// first : 시간
// second : 1(입실), 0(퇴실)
val pq = PriorityQueue<Pair<I... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P155651.class",
"javap": "Compiled from \"P155651.kt\"\npublic final class kr.co.programmers.P155651 {\n public kr.co.programmers.P155651();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P181187.kt | package kr.co.programmers
import kotlin.math.pow
import kotlin.math.sqrt
// https://github.com/antop-dev/algorithm/issues/502
class P181187 {
fun solution(r1: Int, r2: Int): Long {
// y가 0인 점의 개수
var count = 0L + (r2 - r1 + 1) * 4
// x 좌표만 루프
for (x in 1 until r2) {
val... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P181187Kt.class",
"javap": "Compiled from \"P181187.kt\"\npublic final class kr.co.programmers.P181187Kt {\n private static final double pow(int, int);\n Code:\n 0: iload_0\n 1: i2d\n 2: iload_1\n 3: i2d\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P60059.kt | package kr.co.programmers
// https://school.programmers.co.kr/learn/courses/30/lessons/60059
class P60059 {
fun solution(k: Array<IntArray>, lock: Array<IntArray>): Boolean {
var key = k
repeat(4) { // 키를 4번 회전면서 체크한다.
if (check(key, lock)) {
return true
}
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P60059.class",
"javap": "Compiled from \"P60059.kt\"\npublic final class kr.co.programmers.P60059 {\n public kr.co.programmers.P60059();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P92335.kt | package kr.co.programmers
import java.math.BigInteger
// https://github.com/antop-dev/algorithm/issues/403
class P92335 {
companion object {
val TEEN: BigInteger = BigInteger("10")
}
fun solution(n: Int, k: Int): Int {
var answer = 0
val kNumber = decimalToK(n, k) + "0" // n.toSt... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P92335$Companion.class",
"javap": "Compiled from \"P92335.kt\"\npublic final class kr.co.programmers.P92335$Companion {\n private kr.co.programmers.P92335$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P92341.kt | package kr.co.programmers
import kotlin.math.ceil
// https://github.com/antop-dev/algorithm/issues/396
class P92341 {
fun solution(fees: IntArray, records: Array<String>): IntArray {
// 차량의 마지막 입차 시간을 가지고 있는 맵
val inMap = mutableMapOf<String, Int>()
// 차량의 누적 주차 시간을 가지고 있는 맵
val ti... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P92341.class",
"javap": "Compiled from \"P92341.kt\"\npublic final class kr.co.programmers.P92341 {\n public kr.co.programmers.P92341();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P12978.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/411
class P12978 {
companion object {
const val INF = 500_001 // 최대 시간은 K + 1
}
fun solution(N: Int, road: Array<IntArray>, k: Int): Int {
if (N == 1) return 1
// 행노드 -> 열노드간의 거리를 2차원 배열에 담는다.
val gr... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P12978$Companion.class",
"javap": "Compiled from \"P12978.kt\"\npublic final class kr.co.programmers.P12978$Companion {\n private kr.co.programmers.P12978$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P150369.kt | package kr.co.programmers
import java.util.*
// https://github.com/antop-dev/algorithm/issues/491
class P150369 {
fun solution(cap: Int, n: Int, deliveries: IntArray, pickups: IntArray): Long {
val d = Stack<Int>()
val p = Stack<Int>()
var move = 0L // 총 이동거리
for (i in 0 until n) ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P150369.class",
"javap": "Compiled from \"P150369.kt\"\npublic final class kr.co.programmers.P150369 {\n public kr.co.programmers.P150369();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P87377.kt | package kr.co.programmers
// https://school.programmers.co.kr/learn/courses/30/lessons/87377
class P87377 {
fun solution(line: Array<IntArray>): Array<String> {
// 교점 좌표를 기록할 Set
val set = mutableSetOf<Pair<Long, Long>>()
// 가장자리 좌표
var minX = Long.MAX_VALUE
var maxX = Long.... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P87377.class",
"javap": "Compiled from \"P87377.kt\"\npublic final class kr.co.programmers.P87377 {\n public kr.co.programmers.P87377();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P83201.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/314
class P83201 {
fun solution(scores: Array<IntArray>): String {
val n = scores.size
val answer = StringBuffer()
for (j in 0 until n) {
val arr = Array(n) { i -> scores[i][j] }
var min = In... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P83201.class",
"javap": "Compiled from \"P83201.kt\"\npublic final class kr.co.programmers.P83201 {\n public kr.co.programmers.P83201();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P72411.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/386
class P72411 {
fun solution(orders: Array<String>, course: IntArray): Array<String> {
val answer = mutableListOf<String>()
// 메뉴조합을 오름차순으로 정렬
val sorted = orders.map { it.toCharArray().sorted() }
// 메뉴별 갯... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P72411$solution$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class kr.co.programmers.P72411$solution$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.String, java.lang.String> {\... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P42579.kt | package kr.co.programmers
class P42579 {
fun solution(genres: Array<String>, plays: IntArray): IntArray {
// 해시 구조로 저장
// 장르 : [<인덱스, 재생 횟수>, ..., ...]
val hash = mutableMapOf<String, MutableList<IntArray>>().apply {
for (i in plays.indices) {
val genre = genres[... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P42579$solution$lambda$5$$inlined$sortByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class kr.co.programmers.P42579$solution$lambda$5$$inlined$sortByDescending$1<T> implements java.util.Comparator {\n public k... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P49191.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/532
class P49191 {
fun solution(n: Int, results: Array<IntArray>): Int {
// 승/패로 초기화
val graph = Array(n) { IntArray(n) }
for ((win, lose) in results) {
graph[win - 1][lose - 1] = 1
graph[lose... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P49191.class",
"javap": "Compiled from \"P49191.kt\"\npublic final class kr.co.programmers.P49191 {\n public kr.co.programmers.P49191();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P72412.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/374
class P72412 {
fun solution(info: Array<String>, query: Array<String>): IntArray {
val aggregate = mutableMapOf<String, MutableList<Int>>()
// 경우의 수를 집계한다.
for (i in info.indices) {
dfs(aggregate, "",... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P72412.class",
"javap": "Compiled from \"P72412.kt\"\npublic final class kr.co.programmers.P72412 {\n public kr.co.programmers.P72412();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P161988.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/531
class P161988 {
fun solution(sequence: IntArray): Long {
val pulse1 = max(sequence, 1) // [1, -1, 1, ...]
val pulse2 = max(sequence, -1) // [-1, 1, -1, ...]
return maxOf(pulse1, pulse2)
}
private fun ma... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P161988.class",
"javap": "Compiled from \"P161988.kt\"\npublic final class kr.co.programmers.P161988 {\n public kr.co.programmers.P161988();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P72413.kt | package kr.co.programmers
import java.util.*
class P72413 {
companion object {
const val INF = (100_000 * 200) + 1
}
fun solution(n: Int, s: Int, a: Int, b: Int, fares: Array<IntArray>): Int {
// 지점 → (지점들,택시요금)
val paths = paths(n, fares)
// 다익스트라
val office = dij... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P72413$Point.class",
"javap": "Compiled from \"P72413.kt\"\npublic final class kr.co.programmers.P72413$Point {\n private final int n;\n\n private final int cost;\n\n public kr.co.programmers.P72413$Point(int, int);\n Code:\n 0: al... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P67257.kt | package kr.co.programmers
import java.util.*
// https://github.com/antop-dev/algorithm/issues/415
class P67257 {
// 문자열이 숫자인지 판단하는 정규표현식
val number = Regex("^[0-9]*$")
// 연산자 우선 순위 경우의 수
private val ops = listOf(
arrayOf('*', '+', '-'),
arrayOf('*', '-', '+'),
arrayOf('+', '*',... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P67257.class",
"javap": "Compiled from \"P67257.kt\"\npublic final class kr.co.programmers.P67257 {\n private final kotlin.text.Regex number;\n\n private final java.util.List<java.lang.Character[]> ops;\n\n public kr.co.programmers.P67257()... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P154540.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/465
class P154540 {
fun solution(maps: Array<String>): IntArray {
val box = maps.map { StringBuilder(it) }
val answer = mutableListOf<Int>()
// DFS
for (y in box.indices) {
for (x in box[y].indice... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P154540.class",
"javap": "Compiled from \"P154540.kt\"\npublic final class kr.co.programmers.P154540 {\n public kr.co.programmers.P154540();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/java/kr/co/programmers/P81302.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/363
class P81302 {
fun solution(places: Array<Array<String>>): IntArray {
val answer = IntArray(places.size)
for (i in places.indices) answer[i] = place(places[i])
return answer
}
private fun place(place: A... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P81302.class",
"javap": "Compiled from \"P81302.kt\"\npublic final class kr.co.programmers.P81302 {\n public kr.co.programmers.P81302();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P136797.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/537
class P136797 {
// 한 자판에서 다른 자판으로 가는 가중치
private val costs = arrayOf(
intArrayOf(1, 7, 6, 7, 5, 4, 5, 3, 2, 3), // 자판 0
intArrayOf(7, 1, 2, 4, 2, 3, 5, 4, 5, 6),
intArrayOf(6, 2, 1, 2, 3, 2, 3, 5, 4, 5),
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P136797.class",
"javap": "Compiled from \"P136797.kt\"\npublic final class kr.co.programmers.P136797 {\n private final int[][] costs;\n\n public kr.co.programmers.P136797();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P77485.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/253
class P77485 {
fun solution(rows: Int, columns: Int, queries: Array<IntArray>): IntArray {
// 숫자 채우기
var n = 1
val box = Array(rows + 1) { Array(columns + 1) { 0 } }
for (i in 1 until box.size) {
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P77485.class",
"javap": "Compiled from \"P77485.kt\"\npublic final class kr.co.programmers.P77485 {\n public kr.co.programmers.P77485();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P152995.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/486
class P152995 {
fun solution(scores: Array<IntArray>): Int {
var rank = 1
val me = scores[0]
var maxScore = 0
// 근무태도 내림차순 정렬.
// 근무태도 동점인 경우 동료평가 오름차순 정렬
scores.sortWith(Comparator { a, b... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P152995.class",
"javap": "Compiled from \"P152995.kt\"\npublic final class kr.co.programmers.P152995 {\n public kr.co.programmers.P152995();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P1138.kt | package kr.co.programmers
import kotlin.math.abs
// https://leetcode.com/problems/alphabet-board-path/
class P1138 {
fun alphabetBoardPath(target: String): String {
var moves = ""
var p = intArrayOf(0, 0)
for (s in target) {
// 아스키 코드의 특성을 이용한다.
val t = (s - 97).toI... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P1138.class",
"javap": "Compiled from \"P1138.kt\"\npublic final class kr.co.programmers.P1138 {\n public kr.co.programmers.P1138();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P160585.kt | package kr.co.programmers
// https://github.com/antop-dev/algorithm/issues/506
class P160585 {
fun solution(board: Array<String>): Int {
val (oCount, oWin) = check(board, 'O')
val (xCount, xWin) = check(board, 'X')
return when {
// "O"나 "X"의 개수 차이가 나면 안된다.
oCount - x... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P160585.class",
"javap": "Compiled from \"P160585.kt\"\npublic final class kr.co.programmers.P160585 {\n public kr.co.programmers.P160585();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P159993.kt | package kr.co.programmers
import java.util.*
// https://github.com/antop-dev/algorithm/issues/497
class P159993 {
fun solution(maps: Array<String>): Int {
// 시작 지점, 레버, 출구 위치를 찾는다
val pos = IntArray(6)
for (i in maps.indices) {
for (j in maps[i].indices) {
when ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P159993.class",
"javap": "Compiled from \"P159993.kt\"\npublic final class kr.co.programmers.P159993 {\n private final int[] dy;\n\n private final int[] dx;\n\n public kr.co.programmers.P159993();\n Code:\n 0: aload_0\n 1: in... |
antop-dev__algorithm__9a3e762/src/main/kotlin/kr/co/programmers/P67256.kt | package kr.co.programmers
import kotlin.math.abs
// https://programmers.co.kr/learn/courses/30/lessons/67256
class P67256 {
fun solution(numbers: IntArray, hand: String): String {
var answer = ""
val prev = arrayOf(intArrayOf(3, 0), intArrayOf(3, 2)) // 초기 위치
for (n in numbers) {
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/kr/co/programmers/P67256.class",
"javap": "Compiled from \"P67256.kt\"\npublic final class kr.co.programmers.P67256 {\n public kr.co.programmers.P67256();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P79.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/316
class P79 {
fun exist(board: Array<CharArray>, word: String): Boolean {
for (i in board.indices) {
for (j in board[i].indices) {
if (dfs(board, i, j, word, 0)) {
return true
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P79.class",
"javap": "Compiled from \"P79.kt\"\npublic final class com.leetcode.P79 {\n public com.leetcode.P79();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: retu... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P447.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/332
class P447 {
fun numberOfBoomerangs(points: Array<IntArray>): Int {
var answer = 0
for (i in points.indices) {
val map = mutableMapOf<Int, Int>()
for (j in points.indices) {
if (i == j)... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P447.class",
"javap": "Compiled from \"P447.kt\"\npublic final class com.leetcode.P447 {\n public com.leetcode.P447();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P994.kt | package com.leetcode
import java.util.*
// https://github.com/antop-dev/algorithm/issues/487
class P994 {
fun orangesRotting(grid: Array<IntArray>): Int {
val queue = LinkedList<Pair<Int, Int>>()
val fresh = intArrayOf(0) // 함수에 값을 넘기기위해 참조로 씀
for (y in grid.indices) {
for (x i... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P994.class",
"javap": "Compiled from \"P994.kt\"\npublic final class com.leetcode.P994 {\n public com.leetcode.P994();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P539.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/514
class P539 {
fun findMinDifference(timePoints: List<String>): Int {
// 문자열을 분으로 변경
val times = mutableListOf<Int>()
for (s in timePoints) {
val time = time(s)
times += time
// 다음날 시... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P539.class",
"javap": "Compiled from \"P539.kt\"\npublic final class com.leetcode.P539 {\n public com.leetcode.P539();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P131.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/297
class P131 {
fun partition(s: String): List<List<String>> {
// dynamic programming
val dp = Array(s.length) { IntArray(s.length) }.apply {
for (i in s.indices) this[i][i] = 1
for (i in 1 until s.length... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P131.class",
"javap": "Compiled from \"P131.kt\"\npublic final class com.leetcode.P131 {\n public com.leetcode.P131();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P1504.kt | package com.leetcode
// https://leetcode.com/problems/count-submatrices-with-all-ones/
class P1504 {
fun numSubmat(mat: Array<IntArray>): Int {
// For each row i, create an array nums where: if mat[i][j] == 0 then nums[j] = 0 else nums[j] = nums[j-1] +1.
for (i in mat.indices) {
for (j ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P1504.class",
"javap": "Compiled from \"P1504.kt\"\npublic final class com.leetcode.P1504 {\n public com.leetcode.P1504();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P235.kt | package com.leetcode
// https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
class P235 {
fun lowestCommonAncestor(root: TreeNode?, p: TreeNode?, q: TreeNode?): TreeNode? {
val path1 = path(root!!, p!!)
val path2 = path(root, q!!)
println()
println("path1 = ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P235.class",
"javap": "Compiled from \"P235.kt\"\npublic final class com.leetcode.P235 {\n public com.leetcode.P235();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P720.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/267
class P720 {
fun longestWord(words: Array<String>): String {
val root = TrieNode()
var answer = ""
words.sortWith(
Comparator<String> { o1, o2 -> o1.length - o2.length }
.then(Comparator ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P720.class",
"javap": "Compiled from \"P720.kt\"\npublic final class com.leetcode.P720 {\n public com.leetcode.P720();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P130.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/313
class P130 {
fun solve(board: Array<CharArray>) {
val m = board.size
val n = board[0].size
// [0] : 방문 여부
// [1] : 'O' 여부
val visited = Array(m) { Array(n) { IntArray(2) } }
for (j in 0 until ... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P130.class",
"javap": "Compiled from \"P130.kt\"\npublic final class com.leetcode.P130 {\n public com.leetcode.P130();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P311.kt | package com.leetcode
import java.util.*
// https://github.com/antop-dev/algorithm/issues/311
class P311 {
private val dy = intArrayOf(-1, +0, +1, +0)
private val dx = intArrayOf(+0, +1, +0, -1)
fun shortestPath(grid: Array<IntArray>, k: Int): Int {
val m = grid.size
val n = grid[0].size
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P311.class",
"javap": "Compiled from \"P311.kt\"\npublic final class com.leetcode.P311 {\n private final int[] dy;\n\n private final int[] dx;\n\n public com.leetcode.P311();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P486.kt | package com.leetcode
// https://leetcode.com/problems/predict-the-winner/
class P486 {
fun PredictTheWinner(nums: IntArray): Boolean {
if (nums.size <= 2) return true
return predict(nums, 0, 0, nums.lastIndex, 1) >= 0
}
private fun predict(nums: IntArray, score: Int, l: Int, r: Int, t: Int... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P486.class",
"javap": "Compiled from \"P486.kt\"\npublic final class com.leetcode.P486 {\n public com.leetcode.P486();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P1314.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/277
class P1314 {
fun matrixBlockSum(mat: Array<IntArray>, k: Int): Array<IntArray> {
val dp = Array(mat.size) { i -> IntArray(mat[i].size) }.apply {
this[0][0] = mat[0][0]
for (i in 1 until mat.size) this[i][0] =... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P1314.class",
"javap": "Compiled from \"P1314.kt\"\npublic final class com.leetcode.P1314 {\n public com.leetcode.P1314();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P959.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/286
class P959 {
fun regionsBySlashes(grid: Array<String>): Int {
val n = grid.size
val arr = Array(n * 3) { IntArray(n * 3) }
for (i in 0 until (n * n)) {
val p = intArrayOf(i / n * 3, i % n * 3)
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P959.class",
"javap": "Compiled from \"P959.kt\"\npublic final class com.leetcode.P959 {\n public com.leetcode.P959();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P980.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/467
class P980 {
fun uniquePathsIII(grid: Array<IntArray>): Int {
var y = 0
var x = 0
var total = 0 // 갈 수 있는 남은 칸 수
for (i in grid.indices) {
for (j in grid[i].indices) {
val v = grid[... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P980.class",
"javap": "Compiled from \"P980.kt\"\npublic final class com.leetcode.P980 {\n public com.leetcode.P980();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P241.kt | package com.leetcode
// https://leetcode.com/problems/different-ways-to-add-parentheses/
class P241 {
private val ops = setOf('+', '-', '*')
fun diffWaysToCompute(expression: String): List<Int> {
val values = mutableListOf<Int>()
// 연산자를 만나면 왼쪽 계산식과 오른쪽 계산식을 나눠서 재귀
expression.forEachIn... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P241.class",
"javap": "Compiled from \"P241.kt\"\npublic final class com.leetcode.P241 {\n private final java.util.Set<java.lang.Character> ops;\n\n public com.leetcode.P241();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P37.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/459
class P37 {
fun solveSudoku(board: Array<CharArray>) {
solve(board, 0)
}
private fun solve(board: Array<CharArray>, pos: Int): Boolean {
if (pos == 81) {
return true
}
val y = pos / 9
... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P37.class",
"javap": "Compiled from \"P37.kt\"\npublic final class com.leetcode.P37 {\n public com.leetcode.P37();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: retu... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P473.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/494
class P473 {
fun makesquare(matchsticks: IntArray): Boolean {
val sum = matchsticks.sum()
// 모든 성냥의 길이가 4면으로 떨어지지 않으면 안됨
if (sum % 4 > 0) return false
val length = sum / 4
// 길이가 긴 성냥순으로 정렬
mat... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P473.class",
"javap": "Compiled from \"P473.kt\"\npublic final class com.leetcode.P473 {\n public com.leetcode.P473();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P93.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/331
class P93 {
val answer = mutableListOf<String>()
fun restoreIpAddresses(s: String): List<String> {
if (s.length !in 4..12) return listOf()
dfs(s, 0, 0, StringBuffer())
return answer
}
/**
* @param s... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P93.class",
"javap": "Compiled from \"P93.kt\"\npublic final class com.leetcode.P93 {\n private final java.util.List<java.lang.String> answer;\n\n public com.leetcode.P93();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P48.kt | package com.leetcode
// https://github.com/antop-dev/algorithm/issues/280
class P48 {
fun rotate(matrix: Array<IntArray>) {
var p = 0
var length = matrix.size
while (length > 1) {
rotate(matrix, p++, length)
length -= 2
}
}
private fun rotate(matrix:... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P48.class",
"javap": "Compiled from \"P48.kt\"\npublic final class com.leetcode.P48 {\n public com.leetcode.P48();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: retu... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P187.kt | package com.leetcode
// https://leetcode.com/problems/repeated-dna-sequences/
class P187 {
fun findRepeatedDnaSequences(s: String): List<String> {
val answer = mutableSetOf<String>()
if (s.length <= 10) return listOf()
// 해시값들이 들어갈 Set
val seen = mutableSetOf<Int>()
// 처음 10... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P187.class",
"javap": "Compiled from \"P187.kt\"\npublic final class com.leetcode.P187 {\n public com.leetcode.P187();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
antop-dev__algorithm__9a3e762/src/main/kotlin/com/leetcode/P167.kt | package com.leetcode
// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
class P167 {
fun twoSum(numbers: IntArray, target: Int): IntArray {
// target 보다 작은 수의 조합만 찾으면 된다.
var endOfSearch = numbers.lastIndex - 1
for (i in numbers.indices) {
if (numbers[i] > target... | [
{
"class_path": "antop-dev__algorithm__9a3e762/com/leetcode/P167.class",
"javap": "Compiled from \"P167.kt\"\npublic final class com.leetcode.P167 {\n public com.leetcode.P167();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/MaxArea.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* @author: tk (<EMAIL>)
* @date: 2022/1/10
*
* leetcode 11 盛最多水的容器
* https://leetcode-cn.com/problems/container-with-most-water/
*/
class MaxArea {
/**
* 解题思路(双指针法思路浅析)：
* 题目要求找出盛水最多的容器，那么哪些因素会影响到盛水量呢？首先，盛水量完全取决于底*min(左高, 右高)，
* 所以，我们可... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/MaxArea.class",
"javap": "Compiled from \"MaxArea.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.MaxArea {\n public org.baichuan.sample.algorithms.leetcode.middle.MaxArea();\n ... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/SwapPairs.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* https://leetcode.cn/problems/swap-nodes-in-pairs/
*/
class SwapPairs {
fun swapPairs(head: ListNode?): ListNode? {
if (head?.next == null) {
return head
}
val newHead = head.next
//交换后head变成后面的节点，所以head需要连接递归... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/SwapPairsKt.class",
"javap": "Compiled from \"SwapPairs.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.SwapPairsKt {\n public static final void main();\n Code:\n 0: ne... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/Divide.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* https://leetcode.cn/problems/divide-two-integers/
* 两数相除
* 核心思路： 38/3 = 3*2 + 32 = 3*2*2+26= 3*2*2*2 + 14 = 3*2*2*2 + 3*2*2 +2 = 3(2*2*2 + 2*2) +2 = 3 * 12 + 2 = 12
*/
class Divide {
fun divide(dividend: Int, divisor: Int): Int {
if (dividend... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/Divide.class",
"javap": "Compiled from \"Divide.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.Divide {\n public org.baichuan.sample.algorithms.leetcode.middle.Divide();\n C... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/ReverseBetween.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* @author: kuntang (<EMAIL>)
* @date: 2022/4/12
* https://leetcode-cn.com/problems/reverse-linked-list-ii/
*
* 执行用时：136 ms, 在所有 Kotlin 提交中击败了97.62%的用户
* 内存消耗：32.7 MB, 在所有 Kotlin 提交中击败了100.00%的用户
*/
class ReverseBetween {
fun reverseBetween(head: Lis... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/ReverseBetweenKt.class",
"javap": "Compiled from \"ReverseBetween.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.ReverseBetweenKt {\n public static final void main();\n Code... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/Operations.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* @author: tk (<EMAIL>)
* @date: 2022/1/11
*/
class Operations {
var negatives = LongArray(32)
var positives = LongArray(32)
var cacheA = LongArray(32)
var cacheB = LongArray(32)
val NEGATIVE_UNIT = -1
fun Operations() {
neg... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/Operations.class",
"javap": "Compiled from \"Operations.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.Operations {\n private long[] negatives;\n\n private long[] positives;\n... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/middle/Search.kt | package org.baichuan.sample.algorithms.leetcode.middle
/**
* https://leetcode.cn/problems/search-in-rotated-sorted-array/
* 33. 搜索旋转排序数组
*/
class Search {
fun search(nums: IntArray, target: Int): Int {
val first = nums[0]
if (target == first) {
return 0
}
var i = nums... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/middle/SearchKt.class",
"javap": "Compiled from \"Search.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.middle.SearchKt {\n public static final void main();\n Code:\n 0: new ... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/hard/NumberToWords.kt | package org.baichuan.sample.algorithms.leetcode.hard
/**
* @author: tk (<EMAIL>)
* @date: 2022/1/10
* https://leetcode-cn.com/problems/english-int-lcci/
* 面试题 16.08. 整数的英语表示
*/
class NumberToWords {
fun numberToWords(num: Int): String {
val unit = arrayOf("Billion", "Million", "Thousand", "Hundred")
... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/hard/NumberToWordsKt.class",
"javap": "Compiled from \"NumberToWords.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.hard.NumberToWordsKt {\n public static final void main();\n Code:\n ... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/simple/interview/MajorityElement.kt | package org.baichuan.sample.algorithms.leetcode.simple.interview
/**
* 面试题 17.10. 主要元素
* https://leetcode.cn/problems/find-majority-element-lcci/
*/
class MajorityElement {
/**
* 摩尔投票解法
* 遍历，并对不同的元素进行抵消。
* 核心思路是：
* 1. **如果y的个数超过数组一半大小**，则经过抵消后剩下的数一定是y。
* 2. 如果个数超过一半大小的数不存在。则抵消后最后剩... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/simple/interview/MajorityElement.class",
"javap": "Compiled from \"MajorityElement.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.simple.interview.MajorityElement {\n public org.baichuan.sam... |
scientificCommunity__blog-sample__36e291c/algorithms/src/main/kotlin/org/baichuan/sample/algorithms/leetcode/simple/interview/Massage.kt | package org.baichuan.sample.algorithms.leetcode.simple.interview
/**
* https://leetcode.cn/problems/the-masseuse-lcci/
* 面试题 17.16. 按摩师
*/
class Massage {
/**
* 时间复杂度：O(n)
* 空间复杂度：O(n)
* 状态转移方程： dp[i] = max(dp[i-1],dp[i-2])
*/
fun massage(nums: IntArray): Int {
if (nums.isEmpty()... | [
{
"class_path": "scientificCommunity__blog-sample__36e291c/org/baichuan/sample/algorithms/leetcode/simple/interview/MassageKt.class",
"javap": "Compiled from \"Massage.kt\"\npublic final class org.baichuan.sample.algorithms.leetcode.simple.interview.MassageKt {\n public static final void main();\n Code:... |
MhmoudAlim__Coding-challanges__31f0b84/src/leetcode_problems/easy/FindGivenDifference.kt | package leetcode_problems.easy
import kotlin.math.*
/*Given an unsorted array,
return 1 if there exists a pair or more of elements in the array whose difference is 1.
else return 0
Examples:
-Input: arr[] = {5, 20, 3, 2, 6}
=Output: 1
-Input: arr[] = {90, 7, 2, 9, 50}
=Output: 0
*/
fun findPairDifference(nums: I... | [
{
"class_path": "MhmoudAlim__Coding-challanges__31f0b84/leetcode_problems/easy/FindGivenDifferenceKt.class",
"javap": "Compiled from \"FindGivenDifference.kt\"\npublic final class leetcode_problems.easy.FindGivenDifferenceKt {\n public static final int findPairDifference(int[]);\n Code:\n 0: aload... |
MhmoudAlim__Coding-challanges__31f0b84/src/leetcode_problems/hard/MedianOfTwoSortedArrays.kt | package leetcode_problems.hard
/*
https://leetcode.com/problems/median-of-two-sorted-arrays/
*/
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {
val maxNumSize = 1000 ; val maxAllNumsSize = 2000
// Lengths of two arrays
val m = nums1.size
val n = nums2.size
val allNums = ... | [
{
"class_path": "MhmoudAlim__Coding-challanges__31f0b84/leetcode_problems/hard/MedianOfTwoSortedArraysKt.class",
"javap": "Compiled from \"MedianOfTwoSortedArrays.kt\"\npublic final class leetcode_problems.hard.MedianOfTwoSortedArraysKt {\n public static final double findMedianSortedArrays(int[], int[]);\n... |
MhmoudAlim__Coding-challanges__31f0b84/src/leetcode_problems/medium/PairWithGivenDifference.kt | package leetcode_problems.medium
import java.lang.Exception
import kotlin.math.abs
/*
https://www.geeksforgeeks.org/find-a-pair-with-the-given-difference/
Given an unsorted array and a number n,
find if there exists a pair of elements in the array whose difference is n.
Examples:
-Input: arr[] = {5, 20, 3, 2, 50,... | [
{
"class_path": "MhmoudAlim__Coding-challanges__31f0b84/leetcode_problems/medium/PairWithGivenDifferenceKt.class",
"javap": "Compiled from \"PairWithGivenDifference.kt\"\npublic final class leetcode_problems.medium.PairWithGivenDifferenceKt {\n public static final int[] findPair(int[], int);\n Code:\n ... |
MhmoudAlim__Coding-challanges__31f0b84/src/leetcode_problems/medium/LongestCommonPref.kt | package leetcode_problems.medium//https://leetcode.com/problems/longest-common-prefix/
//best
fun longestCommonPrefix(strs: Array<String>?): String {
if (strs == null || strs.isEmpty()) return ""
for (i in 0 until strs[0].length) {
val c = strs[0][i]
for (j in 1 until strs.size) {
i... | [
{
"class_path": "MhmoudAlim__Coding-challanges__31f0b84/leetcode_problems/medium/LongestCommonPrefKt.class",
"javap": "Compiled from \"LongestCommonPref.kt\"\npublic final class leetcode_problems.medium.LongestCommonPrefKt {\n public static final java.lang.String longestCommonPrefix(java.lang.String[]);\n ... |
MhmoudAlim__Coding-challanges__31f0b84/src/leetcode_problems/medium/AddTwoNumbers.kt | package leetcode_problems.medium
/*
https://leetcode.com/problems/add-two-numbers/
*/
/**
* Example:
* var li = ListNode(5)
* var v = li.`val`
* Definition for singly-linked list.
* class ListNode(var `val`: Int) {
* var next: ListNode? = null
* }
* Example 1:
* Input: l1 = [2,4,3], l2 = [5,6,4]
* Outpu... | [
{
"class_path": "MhmoudAlim__Coding-challanges__31f0b84/leetcode_problems/medium/AddTwoNumbersKt.class",
"javap": "Compiled from \"AddTwoNumbers.kt\"\npublic final class leetcode_problems.medium.AddTwoNumbersKt {\n public static final leetcode_problems.medium.ListNode addTwoNumbers(leetcode_problems.medium... |
jens-muenker__fuzzywuzzy-kotlin__da452a7/fuzzywuzzy_kotlin/src/main/java/com/frosch2010/fuzzywuzzy_kotlin/algorithms/Utils.kt | package com.frosch2010.fuzzywuzzy_kotlin.algorithms
import java.util.Arrays
import java.util.Collections
import java.util.PriorityQueue
object Utils {
fun tokenize(`in`: String): List<String> {
return Arrays.asList(*`in`.split("\\s+".toRegex()).dropLastWhile { it.isEmpty() }
.toTypedArray())
... | [
{
"class_path": "jens-muenker__fuzzywuzzy-kotlin__da452a7/com/frosch2010/fuzzywuzzy_kotlin/algorithms/Utils.class",
"javap": "Compiled from \"Utils.kt\"\npublic final class com.frosch2010.fuzzywuzzy_kotlin.algorithms.Utils {\n public static final com.frosch2010.fuzzywuzzy_kotlin.algorithms.Utils INSTANCE;\... |
Const-Grigoryev__LeetCode__cea8e76/Kotlin/src/dev/aspid812/leetcode/problem1854/Solution.kt | package dev.aspid812.leetcode.problem1854
import java.time.Year
/* 1854. Maximum Population Year
* -----------------------------
*
* You are given a 2D integer array `logs` where each `logs[i] = [birth_i, death_i]` indicates the birth and death
* years of the `i`-th person.
*
* The **population** of some year `... | [
{
"class_path": "Const-Grigoryev__LeetCode__cea8e76/dev/aspid812/leetcode/problem1854/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class dev.aspid812.leetcode.problem1854.Solution {\n public dev.aspid812.leetcode.problem1854.Solution();\n Code:\n 0: aload_0\n 1: inv... |
Const-Grigoryev__LeetCode__cea8e76/Kotlin/src/dev/aspid812/leetcode/problem0541/Solution.kt | package dev.aspid812.leetcode.problem0541
/* 541. Reverse String II
* ----------------------
*
* Given a string `s` and an integer `k`, reverse the first `k` characters for every `2k` characters counting
* from the start of the string.
*
* If there are fewer than `k` characters left, reverse all of them. If ther... | [
{
"class_path": "Const-Grigoryev__LeetCode__cea8e76/dev/aspid812/leetcode/problem0541/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class dev.aspid812.leetcode.problem0541.Solution {\n public dev.aspid812.leetcode.problem0541.Solution();\n Code:\n 0: aload_0\n 1: inv... |
Const-Grigoryev__LeetCode__cea8e76/Kotlin/src/dev/aspid812/leetcode/problem0056/Solution.kt | package dev.aspid812.leetcode.problem0056
/* 56. Merge Intervals
* -------------------
*
* Given an array of `intervals` where `intervals[i] = [start_i, end_i]`, merge all overlapping intervals, and return
* *an array of the non-overlapping intervals that cover all the intervals in the input*.
*
* ### Constraint... | [
{
"class_path": "Const-Grigoryev__LeetCode__cea8e76/dev/aspid812/leetcode/problem0056/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class dev.aspid812.leetcode.problem0056.Solution {\n public dev.aspid812.leetcode.problem0056.Solution();\n Code:\n 0: aload_0\n 1: inv... |
Const-Grigoryev__LeetCode__cea8e76/Kotlin/src/dev/aspid812/leetcode/problem0539/Solution.kt | package dev.aspid812.leetcode.problem0539
/* 539. Minimum Time Difference
* ----------------------------
* Given a list of 24-hour clock time points in **"HH:MM"** format, return the *minimum **minutes** difference
* between any two time-points in the list*.
*
* ### Constraints:
*
* * `2 <= timePoints <= 2 * ... | [
{
"class_path": "Const-Grigoryev__LeetCode__cea8e76/dev/aspid812/leetcode/problem0539/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class dev.aspid812.leetcode.problem0539.Solution {\n public dev.aspid812.leetcode.problem0539.Solution();\n Code:\n 0: aload_0\n 1: inv... |
mledl__aoc23__7949d61/src/main/kotlin/challenges/Day03.kt | package challenges
class Day03(private val input: List<String>) {
private val offset = input[0].length + 1
private val inputStr = input.fold("") { acc, s -> acc.plus("$s.") }
private val regex = "\\d+".toRegex()
fun getPart1(): Int = calcRanges(inputStr, offset, input.size).filter { pair -> pair.second... | [
{
"class_path": "mledl__aoc23__7949d61/challenges/Day03.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class challenges.Day03 {\n private final java.util.List<java.lang.String> input;\n\n private final int offset;\n\n private final java.lang.String inputStr;\n\n private final kotlin.text.Reg... |
mledl__aoc23__7949d61/src/main/kotlin/challenges/Day02.kt | package challenges
class Day02(private val input: List<String>) {
private val checkMap = mapOf("red" to 12, "green" to 13, "blue" to 14)
fun getPart1(): Int = input.mapIndexed { index, s -> if (checkGame(s.split(";"))) index + 1 else 0 }.sum()
fun getPart2(): Int = calcPowers(input)
// Part 1 helper... | [
{
"class_path": "mledl__aoc23__7949d61/challenges/Day02.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class challenges.Day02 {\n private final java.util.List<java.lang.String> input;\n\n private final java.util.Map<java.lang.String, java.lang.Integer> checkMap;\n\n public challenges.Day02(ja... |
ProgramaCatalisa__ResolucaoExerciciosKotlin__e0b994c/modulo4/src/aula14/Exercicio08.kt | package aula14
/*Exercício 04 da parte 'Exercícios gerais'*/
fun main() {
print("Informe a quantidade de alunes a turma tem: ")
val quantidadeAlunos = readln().toInt()
val turma = receberDadosAlune(quantidadeAlunos)
val medias = calcularMedia(quantidadeAlunos, turma)
printarMedias(turma, medias)
... | [
{
"class_path": "ProgramaCatalisa__ResolucaoExerciciosKotlin__e0b994c/aula14/Exercicio08Kt.class",
"javap": "Compiled from \"Exercicio08.kt\"\npublic final class aula14.Exercicio08Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Informe a quantidade ... |
devetude__BOJ-PSJ__4c6acff/src/boj_2206/Kotlin.kt | package boj_2206
import java.util.LinkedList
import java.util.StringTokenizer
val DIRECTIONS = arrayOf(arrayOf(0, 1), arrayOf(0, -1), arrayOf(1, 0), arrayOf(-1, 0))
fun main() {
val st = StringTokenizer(readln())
val n = st.nextToken().toInt()
val m = st.nextToken().toInt()
val map = Array(size = n +... | [
{
"class_path": "devetude__BOJ-PSJ__4c6acff/boj_2206/KotlinKt.class",
"javap": "Compiled from \"Kotlin.kt\"\npublic final class boj_2206.KotlinKt {\n private static final java.lang.Integer[][] DIRECTIONS;\n\n public static final java.lang.Integer[][] getDIRECTIONS();\n Code:\n 0: getstatic #1... |
devetude__BOJ-PSJ__4c6acff/src/boj_14888/Kotlin.kt | package boj_14888
import java.util.StringTokenizer
import kotlin.math.max
import kotlin.math.min
var maxValue = Int.MIN_VALUE
var minValue = Int.MAX_VALUE
fun main() {
val n = readln().toInt()
var st = StringTokenizer(readln())
val numbers = IntArray(n)
repeat(n) { numbers[it] = st.nextToken().toInt(... | [
{
"class_path": "devetude__BOJ-PSJ__4c6acff/boj_14888/KotlinKt.class",
"javap": "Compiled from \"Kotlin.kt\"\npublic final class boj_14888.KotlinKt {\n private static int maxValue;\n\n private static int minValue;\n\n public static final int getMaxValue();\n Code:\n 0: getstatic #10 ... |
pocmo__AdventOfCode2021__73bbb6a/src/day4/Day4.kt | package day4
import java.io.File
data class Number(
val value: Int,
var marked: Boolean = false
)
data class Board(
val data: Array<Array<Number>> = Array(5) { Array(5) { Number(0) } }
) {
override fun equals(other: Any?): Boolean {
if (other !is Board) return false
return data.conten... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day4/Day4Kt.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class day4.Day4Kt {\n public static final day4.Board readBoard(java.util.List<java.lang.String>, int);\n Code:\n 0: aload_0\n 1: ldc #10 // String... |
pocmo__AdventOfCode2021__73bbb6a/src/day3/Day3.kt | package day3
import java.io.File
data class Count(
var zeros: Int = 0,
var ones: Int = 0
)
fun part1() {
val lines = File("day3.txt").readLines()
val counts: List<Count> = generateSequence {
Count()
}.take(12).toList()
lines.forEach { line ->
line.forEachIndexed { index, cha... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day3/Day3Kt.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class day3.Day3Kt {\n public static final void part1();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
pocmo__AdventOfCode2021__73bbb6a/src/day2/Day2.kt | package day2
import java.io.File
sealed interface Command {
data class Forward(
val steps: Int
): Command
data class Down(
val steps: Int
) : Command
data class Up(
val steps: Int
) : Command
}
fun readCourse(): List<Command> {
val lines = File("day2.txt").readLi... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day2/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class day2.Day2Kt {\n public static final java.util.List<day2.Command> readCourse();\n Code:\n 0: new #10 // class java/io/File\n 3: dup\n 4... |
pocmo__AdventOfCode2021__73bbb6a/src/day5/Day5.kt | package day5
import java.io.File
data class Line(
val x1: Int,
val y1: Int,
val x2: Int,
val y2: Int
) {
private fun isHorizontal(): Boolean = y1 == y2
private fun isVertical(): Boolean = x1 == x2
private fun isDiagonal(): Boolean = !isHorizontal() && !isVertical()
fun isHorizontalOrVe... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day5/Day5Kt.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class day5.Day5Kt {\n public static final java.util.List<kotlin.Pair<java.lang.Integer, java.lang.Integer>> getDiagonalPoints(int, int, int, int);\n Code:\n 0: new #10 ... |
pocmo__AdventOfCode2021__73bbb6a/src/day12/Day12.kt | package day12
import java.io.File
data class Cave(
val name: String
) {
fun isEnd() = name == "end"
fun isStart() = name == "start"
fun isLarge(): Boolean = name[0].isUpperCase()
fun isSmall() = !isStart() && !isEnd() && name[0].isLowerCase()
}
fun readCavesFromFile(fileName: String): Map<Cave,... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day12/Day12Kt.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class day12.Day12Kt {\n public static final java.util.Map<day12.Cave, java.util.List<day12.Cave>> readCavesFromFile(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc ... |
pocmo__AdventOfCode2021__73bbb6a/src/day14/Day14.kt | package day14
import java.io.File
fun readFile(fileName: String): Pair<String, Map<String, String>> {
return readFromString(File(fileName)
.readText()
.trim())
}
fun Map<String, String>.toCharacterMap(): Map<String, Char> {
return mapValues { (_, character) -> character[0] }
}
fun performIns... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day14/Day14Kt.class",
"javap": "Compiled from \"Day14.kt\"\npublic final class day14.Day14Kt {\n public static final kotlin.Pair<java.lang.String, java.util.Map<java.lang.String, java.lang.String>> readFile(java.lang.String);\n Code:\n 0: aload_0\n... |
pocmo__AdventOfCode2021__73bbb6a/src/day13/Day13.kt | package day13
import java.io.File
data class Point(
val x: Int,
val y: Int
)
data class Paper(
val points: Map<Point, Boolean>
) {
fun fold(instruction: Instruction): Paper {
return when (instruction) {
is Instruction.FoldUp -> foldUp(instruction.y)
is Instruction.Fold... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day13/Day13Kt.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class day13.Day13Kt {\n public static final kotlin.Pair<day13.Paper, java.util.List<day13.Instruction>> readFromFile(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc ... |
pocmo__AdventOfCode2021__73bbb6a/src/day7/Day7.kt | package day7
import java.io.File
import kotlin.math.absoluteValue
fun readCrabSubmarines(): List<Int> {
return File("day7.txt")
.readLines()[0]
.split(",")
.map { it.toInt() }
}
fun calculateFuelSimple(crabSubmarines: List<Int>, position: Int): Int {
return crabSubmarines.sumOf { curr... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day7/Day7Kt.class",
"javap": "Compiled from \"Day7.kt\"\npublic final class day7.Day7Kt {\n public static final java.util.List<java.lang.Integer> readCrabSubmarines();\n Code:\n 0: new #10 // class java/io/File\n 3: ... |
pocmo__AdventOfCode2021__73bbb6a/src/day9/Day9.kt | package day9
import java.io.File
fun readInput(filename: String = "day9.txt"): List<List<Int>>{
return File(filename)
.readLines()
.map { line -> line.toCharArray().map { character -> character.digitToInt() } }
}
fun List<List<Int>>.neighbours(x: Int, y: Int): List<Int> {
val top = get(x).get... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day9/Day9Kt.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class day9.Day9Kt {\n public static final java.util.List<java.util.List<java.lang.Integer>> readInput(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
pocmo__AdventOfCode2021__73bbb6a/src/day8/Day8.kt | package day8
import java.io.File
fun find_one_chars(input: List<List<Char>>): List<Char> {
return input.find { it.size == 2 } ?: throw IllegalStateException("One not found")
}
fun find_four_chars(input: List<List<Char>>): List<Char> {
return input.find { it.size == 4 } ?: throw IllegalStateException("Four no... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day8/Day8Kt.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class day8.Day8Kt {\n public static final java.util.List<java.lang.Character> find_one_chars(java.util.List<? extends java.util.List<java.lang.Character>>);\n Code:\n 0: aload_0\... |
pocmo__AdventOfCode2021__73bbb6a/src/day11/Day11.kt | package day11
import java.io.File
data class Position(
val x: Int,
val y: Int
)
data class Octopus(
var energy: Int,
var flashed: Boolean = false
) {
fun canFlash(): Boolean = energy > 9 && !flashed
fun flash() {
energy = 0
flashed = true
}
fun reset() {
if (... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day11/Day11Kt.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class day11.Day11Kt {\n public static final java.lang.String dump(java.util.List<? extends java.util.List<day11.Octopus>>);\n Code:\n 0: aload_0\n 1: ldc #10 ... |
pocmo__AdventOfCode2021__73bbb6a/src/day17/Day17.kt | package day17
import kotlin.math.max
data class TargetArea(
val xRange: IntRange,
val yRange: IntRange
) {
fun calculateResult(x: Int, y: Int): AreaResult {
return when {
y < yRange.minOrNull()!! -> AreaResult.MissBottom
x > xRange.maxOrNull()!! -> AreaResult.MissRight
... | [
{
"class_path": "pocmo__AdventOfCode2021__73bbb6a/day17/Day17Kt.class",
"javap": "Compiled from \"Day17.kt\"\npublic final class day17.Day17Kt {\n public static final day17.Result toResult(day17.AreaResult, int);\n Code:\n 0: aload_0\n 1: ldc #9 // String <this>\n ... |
achawki__number-sequence-trainer-android__fa47830/app/src/main/java/com/achawki/sequencetrainer/math/Operator.kt | package com.achawki.sequencetrainer.math
import kotlin.math.min
import kotlin.random.Random
interface Operator<T> {
fun apply(t: T): Int
}
enum class BinaryOperator : Operator<Pair<Int, Int>> {
PLUS {
override fun apply(t: Pair<Int, Int>): Int {
return t.first + t.second
}
},
... | [
{
"class_path": "achawki__number-sequence-trainer-android__fa47830/com/achawki/sequencetrainer/math/OperatorKt.class",
"javap": "Compiled from \"Operator.kt\"\npublic final class com.achawki.sequencetrainer.math.OperatorKt {\n public static final java.util.List<com.achawki.sequencetrainer.math.Operator<?>>... |
kogupta__misc-projects__aabace3/kotlin-java/src/main/kotlin/func/prog/java/recursion/ListExtn.kt | package func.prog.java.recursion
fun main(args: Array<String>) {
println("abc".toList().head())
println(List(1) { 'a' }.mkString())
println(('a'..'z').asSequence().toList().mkString())
println("-- fold left --")
println("Sum of [1..10] : " + sum2((1..10).toList()))
println(List(1) { 'a' }.mkS... | [
{
"class_path": "kogupta__misc-projects__aabace3/func/prog/java/recursion/ListExtnKt.class",
"javap": "Compiled from \"ListExtn.kt\"\npublic final class func.prog.java.recursion.ListExtnKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
SERG-Delft__hyperion__a010d1b/plugin/src/main/kotlin/nl/tudelft/hyperion/plugin/metric/APIMetric.kt | package nl.tudelft.hyperion.plugin.metric
/**
* Represents an element as the result of an /api/v1/metrics API call.
* Contains the aggregated log counts over the specified interval, i.e.
* an interval of 60 represents the logs that happened in the last minute.
*/
data class APIMetricsResult(
val interval: Int,... | [
{
"class_path": "SERG-Delft__hyperion__a010d1b/nl/tudelft/hyperion/plugin/metric/APIMetric.class",
"javap": "Compiled from \"APIMetric.kt\"\npublic final class nl.tudelft.hyperion.plugin.metric.APIMetric extends nl.tudelft.hyperion.plugin.metric.BaseAPIMetric {\n private final int line;\n\n private final ... |
SeanShubin__condorcet-backend__c6dd3e8/domain/src/main/kotlin/com/seanshubin/condorcet/backend/domain/Ranking.kt | package com.seanshubin.condorcet.backend.domain
import kotlin.math.max
import kotlin.random.Random
data class Ranking(val candidateName: String, val rank: Int?) {
companion object {
fun List<Ranking>.prefers(a: String, b: String): Boolean =
rankingFor(a) < rankingFor(b)
private fun Li... | [
{
"class_path": "SeanShubin__condorcet-backend__c6dd3e8/com/seanshubin/condorcet/backend/domain/Ranking$Companion.class",
"javap": "Compiled from \"Ranking.kt\"\npublic final class com.seanshubin.condorcet.backend.domain.Ranking$Companion {\n private com.seanshubin.condorcet.backend.domain.Ranking$Companio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.