com_github_leetcode.Node.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.27

package com_github_leetcode

import java.util.StringJoiner
import kotlin.collections.ArrayList

class Node {
    var `val`: Int
    var neighbors: List

    constructor() {
        `val` = 0
        neighbors = ArrayList()
    }

    constructor(`val`: Int) {
        this.`val` = `val`
        neighbors = ArrayList()
    }

    constructor(`val`: Int, neighbors: List) {
        this.`val` = `val`
        this.neighbors = neighbors
    }

    override fun toString(): String {
        val result = StringJoiner(",", "[", "]")
        for (node in neighbors) {
            if (node.neighbors.isEmpty()) {
                result.add(node.`val`.toString())
            } else {
                val result2 = StringJoiner(",", "[", "]")
                for (nodeItem in node.neighbors) {
                    result2.add(nodeItem.`val`.toString())
                }
                result.add(result2.toString())
            }
        }
        return result.toString()
    }
}