package solution

import data.structure.Employee
import java.util.*
import kotlin.collections.HashMap
import kotlin.collections.HashSet
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

class SimulatedProgram {

    /**
     * https://leetcode-cn.com/problems/robot-return-to-origin/
     */
    fun judgeCircle(moves: String): Boolean {
        var x = 0
        var y = 0
        moves.forEach {
            when (it) {
                'R' -> x++
                'L' -> x--
                'D' -> y--
                'U' -> y++
            }
        }
        return x == 0 && y == 0
    }

    fun coinChange(coins: IntArray, amount: Int): Int {
        // 缓存钱数对应的最小硬币数
        val coinsMin = IntArray(amount + 1) { 0 }

        for (i in 1..amount) {
            var minCount = Int.MAX_VALUE
            coins.filter {
                it <= i
            }.forEach {
                val curUsed = coinsMin[i - it] + 1
                if (coinsMin[i - it] >= 0 && curUsed < minCount) {
                    minCount = curUsed
                }
            }
            coinsMin[i] = if (minCount != Int.MAX_VALUE) {
                minCount
            } else {
                -1
            }
        }
        return coinsMin[amount]
    }

    /**
     * https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/
     */
    fun findRestaurant(list1: Array<String>, list2: Array<String>): Array<String> {
        var minStep = Int.MAX_VALUE
        val hash = HashMap<String, Int>(list1.size)
        val result = HashMap<String, Int>()
        list1.forEachIndexed { index, s ->
            hash[s] = index
        }
        list2.forEachIndexed { index, s ->
            if (s in hash) {
                if (index + hash[s]!! < minStep) {
                    minStep = index + hash[s]!!
                }
                result[s] = hash[s]!! + index
            }
        }

        return result.filter { it.value == minStep }.keys.toTypedArray()
    }

    /**
     * https://leetcode-cn.com/problems/binary-search/
     */
    fun search(nums: IntArray, target: Int): Int {
        var left = 0
        var right = nums.lastIndex
        while (left <= right) {
            val middle = (left + right) / 2
            when {
                target < nums[middle] -> right = middle - 1
                target > nums[middle] -> left = middle + 1
                else -> return middle
            }
        }
        return -1
    }

    /**
     * https://leetcode-cn.com/problems/rectangle-overlap/
     */
    fun isRectangleOverlap(rec1: IntArray, rec2: IntArray): Boolean {
        val w1 = (rec1[2] - rec1[0]).toLong()
        val h1 = (rec1[3] - rec1[1]).toLong()
        val xm1 = (rec1[2] + rec1[0]).toLong()
        val ym1 = (rec1[3] + rec1[1]).toLong()

        val w2 = (rec2[2] - rec2[0]).toLong()
        val h2 = (rec2[3] - rec2[1]).toLong()
        val xm2 = (rec2[2] + rec2[0]).toLong()
        val ym2 = (rec2[3] + rec2[1]).toLong()

        return (abs(xm1 - xm2) < (w1 + w2)) && (abs(ym1 - ym2) < (h1 + h2))
    }

    /**
     * https://leetcode-cn.com/problems/rectangle-area/
     * 在二维平面上计算出两个由直线构成的矩形重叠后形成的总面积。
     */
    fun computeArea(A: Int, B: Int, C: Int, D: Int, E: Int, F: Int, G: Int, H: Int): Int {
        val lx = max(A, E).toLong()
        val ly = max(B, F).toLong()
        val rx = min(C, G).toLong()
        val ry = min(D, H).toLong()
        val area1 = (C - A).toLong() * (D - B)
        val area2 = (G - E).toLong() * (H - F)

        // 未相交
        if (E > C || F > D || G < A || H < B) {
            return (area1 + area2).toInt()
        }
        return (area1 + area2 - (rx - lx) * (ry - ly)).toInt()
    }

    /**
     * https://leetcode-cn.com/problems/available-captures-for-rook/
     * 车的可用捕获量
     */
    fun numRookCaptures(board: Array<CharArray>): Int {
        var rx = 0
        var ry = 0
        var result = 0
        board.forEachIndexed { indexArray, chars ->
            chars.forEachIndexed { indexChar, c ->
                if (c == 'R') {
                    rx = indexChar
                    ry = indexArray
                }
            }
        }
        right@ for (i in rx + 1 until board.size) {
            when (board[ry][i]) {
                'p' -> {
                    result++
                    break@right
                }
                '.' -> continue@right
                'B', 'b', 'P' -> break@right
            }
        }
        left@ for (i in rx - 1 downTo 0) {
            when (board[ry][i]) {
                'p' -> {
                    result++
                    break@left
                }
                '.' -> continue@left
                'B', 'b', 'P' -> break@left
            }
        }
        up@ for (j in ry - 1 downTo 0) {
            when (board[j][rx]) {
                'p' -> {
                    result++
                    break@up
                }
                '.' -> continue@up
                'B', 'b', 'P' -> break@up
            }
        }

        down@ for (j in ry + 1 until board.size) {
            when (board[j][rx]) {
                'p' -> {
                    result++
                    break@down
                }
                '.' -> continue@down
                'B', 'b', 'P' -> break@down
            }
        }
        return result
    }

    /**
     * https://leetcode-cn.com/problems/unique-morse-code-words/
     */
    fun uniqueMorseRepresentations(words: Array<String>): Int {
        val morse = arrayOf(
            ".-",
            "-...",
            "-.-.",
            "-..",
            ".",
            "..-.",
            "--.",
            "....",
            "..",
            ".---",
            "-.-",
            ".-..",
            "--",
            "-.",
            "---",
            ".--.",
            "--.-",
            ".-.",
            "...",
            "-",
            "..-",
            "...-",
            ".--",
            "-..-",
            "-.--",
            "--.."
        )
        val set = HashSet<String>()
        words.forEach words@{ word ->
            val code = StringBuffer()
            word.forEach {
                code.append(morse[it - 'a'])
            }
            set.add(code.toString())
        }
        return set.size
    }

    /**
     * https://leetcode-cn.com/problems/subdomain-visit-count/
     */
    fun subdomainVisits(cpdomains: Array<String>): List<String> {
        val countMap = HashMap<String, Int>()
        cpdomains.forEach {
            val countName = it.split(" ")
            if (countName.size >= 2) {
                val count = countName[0].toInt()
                val domain = countName[1]
                countMap[domain] = countMap[domain]?.plus(count) ?: count
                var index = -1
                while (true) {
                    index = domain.indexOf(".", index + 1)
                    if (index == -1) {
                        break
                    }
                    val newDomain = domain.slice(IntRange(index + 1, domain.lastIndex))
                    countMap[newDomain] = countMap[newDomain]?.plus(count) ?: count
                }
            }
        }
        val result = mutableListOf<String>()
        countMap.keys.forEach {
            result.add("${countMap[it]} $it")
        }
        return result
    }

    /**
     * https://leetcode-cn.com/problems/count-number-of-teams/
     */
    fun numTeams(rating: IntArray): Int {
        var sum = 0
        for (i in 1 until rating.lastIndex) {
            var minLeftSum = 0
            var maxLeftSum = 0
            for (j in 0 until i) {
                if (rating[j] > rating[i]) {
                    maxLeftSum++
                } else if (rating[j] < rating[i]) {
                    minLeftSum++
                }
            }

            var minRightSum = 0
            var maxRightSum = 0
            for (j in i + 1 until rating.size) {
                if (rating[j] > rating[i]) {
                    maxRightSum++
                } else if (rating[j] < rating[i]) {
                    minRightSum++
                }
            }
            sum += (minLeftSum * maxRightSum) + (maxLeftSum * minRightSum)
        }
        return sum
    }

    /**
     * https://leetcode-cn.com/problems/number-of-days-between-two-dates/
     */
    fun daysBetweenDates(date1: String, date2: String): Int {
        val parserDate: (Int, Int, Int) -> Int = { year, month, day ->
            val monthDays = intArrayOf(31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)
            var days = 0
            for (i in 1 until month) {
                days += monthDays[i - 1]
            }
            if ((year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) && month > 2) {
                days++
            }
            days += day
            days += 365 * (year - 1970) + (year - 1) / 4 - (year - 1) / 100 + (year - 1) / 400
            days
        }
        val days1 = parserDate(date1.take(4).toInt(), date1.slice(IntRange(5, 6)).toInt(), date1.takeLast(2).toInt())
        val days2 = parserDate(date2.take(4).toInt(), date2.slice(IntRange(5, 6)).toInt(), date2.takeLast(2).toInt())
        return abs(days2 - days1)
    }

    /**
     * https://leetcode-cn.com/problems/container-with-most-water/
     */
    fun maxArea(height: IntArray): Int {
        var area = 0
        for (i in 0 until height.lastIndex) {
            for (j in i + 1 until height.size) {
                val s = (j - i) * min(height[j], height[i])
                area = max(area, s)
            }
        }
        return area
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-125/problems/find-the-town-judge/
     */
    fun findJudge(N: Int, trust: Array<IntArray>): Int {
        val vote = IntArray(N) { 0 }
        trust.forEach {
            if (it.size >= 2) {
                vote[it[0] - 1]--
                vote[it[1] - 1]++
            }
        }
        val index = vote.indexOfFirst { it == N - 1 }
        return if (index >= 0) index + 1 else -1
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-135/problems/valid-boomerang/
     */
    fun isBoomerang(points: Array<IntArray>): Boolean {
        if (points[0][1] == points[1][1] && points[0][0] == points[1][0] ||
            points[1][1] == points[2][1] && points[1][0] == points[2][0] ||
            points[0][1] == points[2][1] && points[0][0] == points[2][0]
        ) {
            return false
        }
        // x相同
        if (points[0][0] == points[1][0]) {
            return points[0][0] != points[2][0]
        }
        // y相同
        if (points[0][1] == points[1][1]) {
            return points[0][1] != points[2][1]
        }
        return (points[2][1] - points[0][1]) * (points[1][0] - points[0][0]) != (points[2][0] - points[0][0]) * (points[1][1] - points[0][1])
    }

    /**
     * https://leetcode-cn.com/problems/surface-area-of-3d-shapes/
     */
    fun surfaceArea(grid: Array<IntArray>): Int {
        var ans = 0
        grid.forEachIndexed { i, ints ->
            ints.forEachIndexed { j, n ->
                if (n > 0) {
                    ans += 4 * n + 2
                    if (j > 0) {
                        ans -= min(ints[j - 1], n) * 2
                    }
                    if (i > 0) {
                        ans -= min(grid[i - 1][j], n) * 2
                    }
                }
            }
        }
        return ans
    }

    /**
     *
     */
    fun minCount(coins: IntArray): Int {
        var sum = 0
        coins.forEach {
            sum += (it + 1) / 2
        }
        return sum
    }

    private var wayCount = 0

    /**
     *
     */
    fun numWays(n: Int, relation: Array<IntArray>, k: Int): Int {
        wayDfs(n, k, 0, 0, relation)
        return wayCount
    }

    private fun wayDfs(n: Int, k: Int, level: Int, pos: Int, relation: Array<IntArray>) {
        if (level == k) { // k轮
            if (pos == n - 1) {
                wayCount++
            }
            return
        }
        relation.forEach {
            if (it[0] == pos) {
                wayDfs(n, k, level + 1, it[1], relation)
            }
        }
    }

    /**
     *
     */
    fun getTriggerTime(increase: Array<IntArray>, requirements: Array<IntArray>): IntArray {
        val m = IntArray(3) { 0 }
        val ans = IntArray(requirements.size) { -1 }
        val rSort = Array(requirements.size) { IntArray(4) }
        var startIndex = 0
        requirements.forEachIndexed { index, ints ->
            rSort[index][0] = ints[0]
            rSort[index][1] = ints[1]
            rSort[index][2] = ints[2]
            rSort[index][3] = index
            if (ints[0] == 0 && ints[1] == 0 && ints[2] == 0) {
                ans[index] = 0
            }
        }

        increase.forEachIndexed { index, it ->
            m[0] += it[0]
            m[1] += it[1]
            m[2] += it[2]
            val start = startIndex
            for (i in start until rSort.size) {
                if (ans[rSort[i][3]] == -1 && rSort[i][0] <= m[0] && rSort[i][1] <= m[1] && rSort[i][2] <= m[2]) {
                    ans[rSort[i][3]] = index + 1

                    val temp = rSort[i]
                    rSort[i] = rSort[startIndex]
                    rSort[startIndex] = temp
                    startIndex++
                }
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-185/problems/display-table-of-food-orders-in-a-restaurant/
     */
    fun displayTable(orders: List<List<String>>): List<List<String>> {
        val ans = mutableListOf<List<String>>()
        val foods = HashSet<String>()
        val orderMap = HashMap<Int, MutableMap<String, Int>>()
        orders.forEach { order ->
            val foodName = order[2]
            foods.add(foodName)
            val id = order[1].toInt()
            if (id in orderMap) {
                val map = orderMap[id]!!
                map[foodName] = map[foodName]?.plus(1) ?: 1
            } else {
                orderMap[id] = mutableMapOf(Pair(foodName, 1))
            }
        }
        val title = mutableListOf("Table")
        foods.sorted().forEach { title.add(it) }
        ans.add(title)
        orderMap.keys.sorted().forEach { key ->
            val map = orderMap[key]!!
            val line = mutableListOf(key.toString())
            for (i in 1 until title.size) {
                line.add(map[title[i]]?.toString() ?: "0")
            }
            ans.add(line)
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-185/problems/minimum-number-of-frogs-croaking/
     */
    fun minNumberOfFrogs(croakOfFrogs: String): Int {
        val frogs = mutableListOf<Int>()
        val croak = charArrayOf('c', 'r', 'o', 'a', 'k')
        croakOfFrogs.forEach {
            val index = croak.indexOf(it)
            frogs.forEachIndexed { i, item ->
                if (item + 1 == index) {
                    frogs[i]++
                    if (index == croak.lastIndex) {
                        frogs[i] = -1
                    }
                    return@forEach
                }
            }
            if (index != 0) {
                return -1
            }
            frogs.add(0)
        }
        if (frogs.count { it == -1 } != frogs.size) {
            return -1
        }
        return frogs.size
    }

    /**
     * https://leetcode-cn.com/problems/employee-importance/
     */
    fun getImportance(employees: List<Employee?>, id: Int): Int {
        val ids = HashMap<Int, Employee>()
        employees.forEach {
            if (it != null) {
                ids[it.id] = it
            }
        }
        var ans = 0
        val target = mutableListOf<Int>()
        target.add(id)
        while (target.isNotEmpty()) {
            val p = ids[target.first()]
            if (p != null) {
                ans += p.importance
                target.addAll(p.subordinates)
                target.removeAt(0)
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/gray-code/
     */
    fun grayCode(n: Int): List<Int> {
        val ans = mutableListOf<Int>()
        ans.add(0)
        repeat(n) {
            val size = ans.size
            for (i in size - 1 downTo 0) {
                val code = (1).shl(it).or(ans[i])
                ans.add(code)
            }
        }
        return ans
    }

    fun largestPerimeter(A: IntArray): Int {
        A.sort()
        for (i in A.lastIndex downTo 2) {
            if (A[i - 1] + A[i - 2] > A[i]) {
                return A[i - 1] + A[i - 2] + A[i]
            }
        }
        return 0
    }

    /**
     * https://leetcode-cn.com/problems/number-of-lines-to-write-string/
     */
    fun numberOfLines(widths: IntArray, S: String): IntArray {
        var line = 1
        var width = 0
        S.forEach {
            val charWidth = widths[it - 'a']
            if (charWidth + width <= 100) {
                width += charWidth
            } else {
                width = charWidth
                line++
            }
        }
        return intArrayOf(line, width)
    }

    /**
     * https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number/
     */
    fun smallerNumbersThanCurrent(nums: IntArray): IntArray {
        val count = Array(101) { 0 }
        val ans = IntArray(nums.size)

        nums.forEach {
            count[it]++
        }
        var temp = 0
        count.forEachIndexed { index, i ->
            if (index > 0) {
                val small = temp + count[index - 1]
                temp = i
                count[index] = small
            } else {
                temp = count[0]
                count[0] = 0
            }
        }
        nums.forEachIndexed { index, i ->
            ans[index] = count[i]
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/maximize-distance-to-closest-person/
     */
    fun maxDistToClosest(seats: IntArray): Int {
        val left = IntArray(seats.size) { seats.size }
        val right = IntArray(seats.size) { seats.size }

        for (i in seats.indices) {
            if (seats[i] == 1) {
                left[i] = 0
            } else if (i > 0) {
                left[i] = left[i - 1] + 1
            }
        }

        for (i in seats.lastIndex downTo 0) {
            if (seats[i] == 1) {
                right[i] = 0
            } else if (i < seats.lastIndex) {
                right[i] = right[i + 1] + 1
            }
        }
        var ans = 0
        seats.forEachIndexed { index, i ->
            if (i == 0) {
                ans = max(ans, min(left[index], right[index]))
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/backspace-string-compare/
     */
    fun backspaceCompare(S: String, T: String): Boolean {
        val s = Stack<Char>()
        val t = Stack<Char>()
        val action: (String, Stack<Char>) -> Unit = { c, stack ->
            c.forEach {
                if (it == '#') {
                    if (stack.isNotEmpty()) {
                        stack.pop()
                    }
                } else {
                    stack.push(it)
                }
            }
        }
        action(S, s)
        action(T, t)
        if (s.size != t.size) {
            return false
        }
        for (i in s.indices) {
            if (s.pop() != t.pop()) {
                return false
            }
        }
        return true
    }

    /**
     * https://leetcode-cn.com/problems/diagonal-traverse-ii/
     */
    fun findDiagonalOrder(nums: List<List<Int>>): IntArray {
        val ans = mutableListOf<Int>()
        val queue = LinkedList<IntArray>()
        val addQueue: (LinkedList<IntArray>, Int, Int, List<MutableList<Int>>) -> Unit = { q, i, j, n ->
            if (i < nums.size && j < nums[i].size && nums[i][j] >= 0) {
                val num = n[i][j]
                n[i][j] = -num
                q.add(intArrayOf(i, j, num))
            }
        }
        addQueue(queue, 0, 0, nums as List<MutableList<Int>>)
        while (queue.isNotEmpty()) {
            val item = queue.pop()
            ans.add(item[2])

            addQueue(queue, item[0] + 1, item[1], nums)
            addQueue(queue, item[0], item[1] + 1, nums)
        }
        return ans.toIntArray()
    }

    /**
     * https://leetcode-cn.com/problems/jewels-and-stones/
     */
    fun numJewelsInStones(J: String, S: String): Int {
        val flag = IntArray(52) { 0 }
        var ans = 0
        J.forEach {
            if (it.isLowerCase()) {
                flag[it - 'a']++
            } else if (it.isUpperCase()) {
                flag[it - 'A' + 26]++
            }
        }
        S.forEach {
            if (it.isLowerCase()) {
                ans += if (flag[it - 'a'] > 0) 1 else 0
            } else if (it.isUpperCase()) {
                ans += if (flag[it - 'A' + 26] > 0) 1 else 0
            }
        }
        return ans
    }
}
package solution

import data.structure.Employee
import java.util.*
import kotlin.collections.HashMap
import kotlin.collections.HashSet
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

class SimulatedProgram {

    /**
     * https://leetcode-cn.com/problems/robot-return-to-origin/
     */
    fun judgeCircle(moves: String): Boolean {
        var x = 0
        var y = 0
        moves.forEach {
            when (it) {
                'R' -> x++
                'L' -> x--
                'D' -> y--
                'U' -> y++
            }
        }
        return x == 0 && y == 0
    }

    fun coinChange(coins: IntArray, amount: Int): Int {
        // 缓存钱数对应的最小硬币数
        val coinsMin = IntArray(amount + 1) { 0 }

        for (i in 1..amount) {
            var minCount = Int.MAX_VALUE
            coins.filter {
                it <= i
            }.forEach {
                val curUsed = coinsMin[i - it] + 1
                if (coinsMin[i - it] >= 0 && curUsed < minCount) {
                    minCount = curUsed
                }
            }
            coinsMin[i] = if (minCount != Int.MAX_VALUE) {
                minCount
            } else {
                -1
            }
        }
        return coinsMin[amount]
    }

    /**
     * https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/
     */
    fun findRestaurant(list1: Array<String>, list2: Array<String>): Array<String> {
        var minStep = Int.MAX_VALUE
        val hash = HashMap<String, Int>(list1.size)
        val result = HashMap<String, Int>()
        list1.forEachIndexed { index, s ->
            hash[s] = index
        }
        list2.forEachIndexed { index, s ->
            if (s in hash) {
                if (index + hash[s]!! < minStep) {
                    minStep = index + hash[s]!!
                }
                result[s] = hash[s]!! + index
            }
        }

        return result.filter { it.value == minStep }.keys.toTypedArray()
    }

    /**
     * https://leetcode-cn.com/problems/binary-search/
     */
    fun search(nums: IntArray, target: Int): Int {
        var left = 0
        var right = nums.lastIndex
        while (left <= right) {
            val middle = (left + right) / 2
            when {
                target < nums[middle] -> right = middle - 1
                target > nums[middle] -> left = middle + 1
                else -> return middle
            }
        }
        return -1
    }

    /**
     * https://leetcode-cn.com/problems/rectangle-overlap/
     */
    fun isRectangleOverlap(rec1: IntArray, rec2: IntArray): Boolean {
        val w1 = (rec1[2] - rec1[0]).toLong()
        val h1 = (rec1[3] - rec1[1]).toLong()
        val xm1 = (rec1[2] + rec1[0]).toLong()
        val ym1 = (rec1[3] + rec1[1]).toLong()

        val w2 = (rec2[2] - rec2[0]).toLong()
        val h2 = (rec2[3] - rec2[1]).toLong()
        val xm2 = (rec2[2] + rec2[0]).toLong()
        val ym2 = (rec2[3] + rec2[1]).toLong()

        return (abs(xm1 - xm2) < (w1 + w2)) && (abs(ym1 - ym2) < (h1 + h2))
    }

    /**
     * https://leetcode-cn.com/problems/rectangle-area/
     * 在二维平面上计算出两个由直线构成的矩形重叠后形成的总面积。
     */
    fun computeArea(A: Int, B: Int, C: Int, D: Int, E: Int, F: Int, G: Int, H: Int): Int {
        val lx = max(A, E).toLong()
        val ly = max(B, F).toLong()
        val rx = min(C, G).toLong()
        val ry = min(D, H).toLong()
        val area1 = (C - A).toLong() * (D - B)
        val area2 = (G - E).toLong() * (H - F)

        // 未相交
        if (E > C || F > D || G < A || H < B) {
            return (area1 + area2).toInt()
        }
        return (area1 + area2 - (rx - lx) * (ry - ly)).toInt()
    }

    /**
     * https://leetcode-cn.com/problems/available-captures-for-rook/
     * 车的可用捕获量
     */
    fun numRookCaptures(board: Array<CharArray>): Int {
        var rx = 0
        var ry = 0
        var result = 0
        board.forEachIndexed { indexArray, chars ->
            chars.forEachIndexed { indexChar, c ->
                if (c == 'R') {
                    rx = indexChar
                    ry = indexArray
                }
            }
        }
        right@ for (i in rx + 1 until board.size) {
            when (board[ry][i]) {
                'p' -> {
                    result++
                    break@right
                }
                '.' -> continue@right
                'B', 'b', 'P' -> break@right
            }
        }
        left@ for (i in rx - 1 downTo 0) {
            when (board[ry][i]) {
                'p' -> {
                    result++
                    break@left
                }
                '.' -> continue@left
                'B', 'b', 'P' -> break@left
            }
        }
        up@ for (j in ry - 1 downTo 0) {
            when (board[j][rx]) {
                'p' -> {
                    result++
                    break@up
                }
                '.' -> continue@up
                'B', 'b', 'P' -> break@up
            }
        }

        down@ for (j in ry + 1 until board.size) {
            when (board[j][rx]) {
                'p' -> {
                    result++
                    break@down
                }
                '.' -> continue@down
                'B', 'b', 'P' -> break@down
            }
        }
        return result
    }

    /**
     * https://leetcode-cn.com/problems/unique-morse-code-words/
     */
    fun uniqueMorseRepresentations(words: Array<String>): Int {
        val morse = arrayOf(
            ".-",
            "-...",
            "-.-.",
            "-..",
            ".",
            "..-.",
            "--.",
            "....",
            "..",
            ".---",
            "-.-",
            ".-..",
            "--",
            "-.",
            "---",
            ".--.",
            "--.-",
            ".-.",
            "...",
            "-",
            "..-",
            "...-",
            ".--",
            "-..-",
            "-.--",
            "--.."
        )
        val set = HashSet<String>()
        words.forEach words@{ word ->
            val code = StringBuffer()
            word.forEach {
                code.append(morse[it - 'a'])
            }
            set.add(code.toString())
        }
        return set.size
    }

    /**
     * https://leetcode-cn.com/problems/subdomain-visit-count/
     */
    fun subdomainVisits(cpdomains: Array<String>): List<String> {
        val countMap = HashMap<String, Int>()
        cpdomains.forEach {
            val countName = it.split(" ")
            if (countName.size >= 2) {
                val count = countName[0].toInt()
                val domain = countName[1]
                countMap[domain] = countMap[domain]?.plus(count) ?: count
                var index = -1
                while (true) {
                    index = domain.indexOf(".", index + 1)
                    if (index == -1) {
                        break
                    }
                    val newDomain = domain.slice(IntRange(index + 1, domain.lastIndex))
                    countMap[newDomain] = countMap[newDomain]?.plus(count) ?: count
                }
            }
        }
        val result = mutableListOf<String>()
        countMap.keys.forEach {
            result.add("${countMap[it]} $it")
        }
        return result
    }

    /**
     * https://leetcode-cn.com/problems/count-number-of-teams/
     */
    fun numTeams(rating: IntArray): Int {
        var sum = 0
        for (i in 1 until rating.lastIndex) {
            var minLeftSum = 0
            var maxLeftSum = 0
            for (j in 0 until i) {
                if (rating[j] > rating[i]) {
                    maxLeftSum++
                } else if (rating[j] < rating[i]) {
                    minLeftSum++
                }
            }

            var minRightSum = 0
            var maxRightSum = 0
            for (j in i + 1 until rating.size) {
                if (rating[j] > rating[i]) {
                    maxRightSum++
                } else if (rating[j] < rating[i]) {
                    minRightSum++
                }
            }
            sum += (minLeftSum * maxRightSum) + (maxLeftSum * minRightSum)
        }
        return sum
    }

    /**
     * https://leetcode-cn.com/problems/number-of-days-between-two-dates/
     */
    fun daysBetweenDates(date1: String, date2: String): Int {
        val parserDate: (Int, Int, Int) -> Int = { year, month, day ->
            val monthDays = intArrayOf(31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)
            var days = 0
            for (i in 1 until month) {
                days += monthDays[i - 1]
            }
            if ((year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) && month > 2) {
                days++
            }
            days += day
            days += 365 * (year - 1970) + (year - 1) / 4 - (year - 1) / 100 + (year - 1) / 400
            days
        }
        val days1 = parserDate(date1.take(4).toInt(), date1.slice(IntRange(5, 6)).toInt(), date1.takeLast(2).toInt())
        val days2 = parserDate(date2.take(4).toInt(), date2.slice(IntRange(5, 6)).toInt(), date2.takeLast(2).toInt())
        return abs(days2 - days1)
    }

    /**
     * https://leetcode-cn.com/problems/container-with-most-water/
     */
    fun maxArea(height: IntArray): Int {
        var area = 0
        for (i in 0 until height.lastIndex) {
            for (j in i + 1 until height.size) {
                val s = (j - i) * min(height[j], height[i])
                area = max(area, s)
            }
        }
        return area
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-125/problems/find-the-town-judge/
     */
    fun findJudge(N: Int, trust: Array<IntArray>): Int {
        val vote = IntArray(N) { 0 }
        trust.forEach {
            if (it.size >= 2) {
                vote[it[0] - 1]--
                vote[it[1] - 1]++
            }
        }
        val index = vote.indexOfFirst { it == N - 1 }
        return if (index >= 0) index + 1 else -1
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-135/problems/valid-boomerang/
     */
    fun isBoomerang(points: Array<IntArray>): Boolean {
        if (points[0][1] == points[1][1] && points[0][0] == points[1][0] ||
            points[1][1] == points[2][1] && points[1][0] == points[2][0] ||
            points[0][1] == points[2][1] && points[0][0] == points[2][0]
        ) {
            return false
        }
        // x相同
        if (points[0][0] == points[1][0]) {
            return points[0][0] != points[2][0]
        }
        // y相同
        if (points[0][1] == points[1][1]) {
            return points[0][1] != points[2][1]
        }
        return (points[2][1] - points[0][1]) * (points[1][0] - points[0][0]) != (points[2][0] - points[0][0]) * (points[1][1] - points[0][1])
    }

    /**
     * https://leetcode-cn.com/problems/surface-area-of-3d-shapes/
     */
    fun surfaceArea(grid: Array<IntArray>): Int {
        var ans = 0
        grid.forEachIndexed { i, ints ->
            ints.forEachIndexed { j, n ->
                if (n > 0) {
                    ans += 4 * n + 2
                    if (j > 0) {
                        ans -= min(ints[j - 1], n) * 2
                    }
                    if (i > 0) {
                        ans -= min(grid[i - 1][j], n) * 2
                    }
                }
            }
        }
        return ans
    }

    /**
     *
     */
    fun minCount(coins: IntArray): Int {
        var sum = 0
        coins.forEach {
            sum += (it + 1) / 2
        }
        return sum
    }

    private var wayCount = 0

    /**
     *
     */
    fun numWays(n: Int, relation: Array<IntArray>, k: Int): Int {
        wayDfs(n, k, 0, 0, relation)
        return wayCount
    }

    private fun wayDfs(n: Int, k: Int, level: Int, pos: Int, relation: Array<IntArray>) {
        if (level == k) { // k轮
            if (pos == n - 1) {
                wayCount++
            }
            return
        }
        relation.forEach {
            if (it[0] == pos) {
                wayDfs(n, k, level + 1, it[1], relation)
            }
        }
    }

    /**
     *
     */
    fun getTriggerTime(increase: Array<IntArray>, requirements: Array<IntArray>): IntArray {
        val m = IntArray(3) { 0 }
        val ans = IntArray(requirements.size) { -1 }
        val rSort = Array(requirements.size) { IntArray(4) }
        var startIndex = 0
        requirements.forEachIndexed { index, ints ->
            rSort[index][0] = ints[0]
            rSort[index][1] = ints[1]
            rSort[index][2] = ints[2]
            rSort[index][3] = index
            if (ints[0] == 0 && ints[1] == 0 && ints[2] == 0) {
                ans[index] = 0
            }
        }

        increase.forEachIndexed { index, it ->
            m[0] += it[0]
            m[1] += it[1]
            m[2] += it[2]
            val start = startIndex
            for (i in start until rSort.size) {
                if (ans[rSort[i][3]] == -1 && rSort[i][0] <= m[0] && rSort[i][1] <= m[1] && rSort[i][2] <= m[2]) {
                    ans[rSort[i][3]] = index + 1

                    val temp = rSort[i]
                    rSort[i] = rSort[startIndex]
                    rSort[startIndex] = temp
                    startIndex++
                }
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-185/problems/display-table-of-food-orders-in-a-restaurant/
     */
    fun displayTable(orders: List<List<String>>): List<List<String>> {
        val ans = mutableListOf<List<String>>()
        val foods = HashSet<String>()
        val orderMap = HashMap<Int, MutableMap<String, Int>>()
        orders.forEach { order ->
            val foodName = order[2]
            foods.add(foodName)
            val id = order[1].toInt()
            if (id in orderMap) {
                val map = orderMap[id]!!
                map[foodName] = map[foodName]?.plus(1) ?: 1
            } else {
                orderMap[id] = mutableMapOf(Pair(foodName, 1))
            }
        }
        val title = mutableListOf("Table")
        foods.sorted().forEach { title.add(it) }
        ans.add(title)
        orderMap.keys.sorted().forEach { key ->
            val map = orderMap[key]!!
            val line = mutableListOf(key.toString())
            for (i in 1 until title.size) {
                line.add(map[title[i]]?.toString() ?: "0")
            }
            ans.add(line)
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/contest/weekly-contest-185/problems/minimum-number-of-frogs-croaking/
     */
    fun minNumberOfFrogs(croakOfFrogs: String): Int {
        val frogs = mutableListOf<Int>()
        val croak = charArrayOf('c', 'r', 'o', 'a', 'k')
        croakOfFrogs.forEach {
            val index = croak.indexOf(it)
            frogs.forEachIndexed { i, item ->
                if (item + 1 == index) {
                    frogs[i]++
                    if (index == croak.lastIndex) {
                        frogs[i] = -1
                    }
                    return@forEach
                }
            }
            if (index != 0) {
                return -1
            }
            frogs.add(0)
        }
        if (frogs.count { it == -1 } != frogs.size) {
            return -1
        }
        return frogs.size
    }

    /**
     * https://leetcode-cn.com/problems/employee-importance/
     */
    fun getImportance(employees: List<Employee?>, id: Int): Int {
        val ids = HashMap<Int, Employee>()
        employees.forEach {
            if (it != null) {
                ids[it.id] = it
            }
        }
        var ans = 0
        val target = mutableListOf<Int>()
        target.add(id)
        while (target.isNotEmpty()) {
            val p = ids[target.first()]
            if (p != null) {
                ans += p.importance
                target.addAll(p.subordinates)
                target.removeAt(0)
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/gray-code/
     */
    fun grayCode(n: Int): List<Int> {
        val ans = mutableListOf<Int>()
        ans.add(0)
        repeat(n) {
            val size = ans.size
            for (i in size - 1 downTo 0) {
                val code = (1).shl(it).or(ans[i])
                ans.add(code)
            }
        }
        return ans
    }

    fun largestPerimeter(A: IntArray): Int {
        A.sort()
        for (i in A.lastIndex downTo 2) {
            if (A[i - 1] + A[i - 2] > A[i]) {
                return A[i - 1] + A[i - 2] + A[i]
            }
        }
        return 0
    }

    /**
     * https://leetcode-cn.com/problems/number-of-lines-to-write-string/
     */
    fun numberOfLines(widths: IntArray, S: String): IntArray {
        var line = 1
        var width = 0
        S.forEach {
            val charWidth = widths[it - 'a']
            if (charWidth + width <= 100) {
                width += charWidth
            } else {
                width = charWidth
                line++
            }
        }
        return intArrayOf(line, width)
    }

    /**
     * https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number/
     */
    fun smallerNumbersThanCurrent(nums: IntArray): IntArray {
        val count = Array(101) { 0 }
        val ans = IntArray(nums.size)

        nums.forEach {
            count[it]++
        }
        var temp = 0
        count.forEachIndexed { index, i ->
            if (index > 0) {
                val small = temp + count[index - 1]
                temp = i
                count[index] = small
            } else {
                temp = count[0]
                count[0] = 0
            }
        }
        nums.forEachIndexed { index, i ->
            ans[index] = count[i]
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/maximize-distance-to-closest-person/
     */
    fun maxDistToClosest(seats: IntArray): Int {
        val left = IntArray(seats.size) { seats.size }
        val right = IntArray(seats.size) { seats.size }

        for (i in seats.indices) {
            if (seats[i] == 1) {
                left[i] = 0
            } else if (i > 0) {
                left[i] = left[i - 1] + 1
            }
        }

        for (i in seats.lastIndex downTo 0) {
            if (seats[i] == 1) {
                right[i] = 0
            } else if (i < seats.lastIndex) {
                right[i] = right[i + 1] + 1
            }
        }
        var ans = 0
        seats.forEachIndexed { index, i ->
            if (i == 0) {
                ans = max(ans, min(left[index], right[index]))
            }
        }
        return ans
    }

    /**
     * https://leetcode-cn.com/problems/backspace-string-compare/
     */
    fun backspaceCompare(S: String, T: String): Boolean {
        val s = Stack<Char>()
        val t = Stack<Char>()
        val action: (String, Stack<Char>) -> Unit = { c, stack ->
            c.forEach {
                if (it == '#') {
                    if (stack.isNotEmpty()) {
                        stack.pop()
                    }
                } else {
                    stack.push(it)
                }
            }
        }
        action(S, s)
        action(T, t)
        if (s.size != t.size) {
            return false
        }
        for (i in s.indices) {
            if (s.pop() != t.pop()) {
                return false
            }
        }
        return true
    }

    /**
     * https://leetcode-cn.com/problems/diagonal-traverse-ii/
     */
    fun findDiagonalOrder(nums: List<List<Int>>): IntArray {
        val ans = mutableListOf<Int>()
        val queue = LinkedList<IntArray>()
        val addQueue: (LinkedList<IntArray>, Int, Int, List<MutableList<Int>>) -> Unit = { q, i, j, n ->
            if (i < nums.size && j < nums[i].size && nums[i][j] >= 0) {
                val num = n[i][j]
                n[i][j] = -num
                q.add(intArrayOf(i, j, num))
            }
        }
        addQueue(queue, 0, 0, nums as List<MutableList<Int>>)
        while (queue.isNotEmpty()) {
            val item = queue.pop()
            ans.add(item[2])

            addQueue(queue, item[0] + 1, item[1], nums)
            addQueue(queue, item[0], item[1] + 1, nums)
        }
        return ans.toIntArray()
    }

    /**
     * https://leetcode-cn.com/problems/jewels-and-stones/
     */
    fun numJewelsInStones(J: String, S: String): Int {
        val flag = IntArray(52) { 0 }
        var ans = 0
        J.forEach {
            if (it.isLowerCase()) {
                flag[it - 'a']++
            } else if (it.isUpperCase()) {
                flag[it - 'A' + 26]++
            }
        }
        S.forEach {
            if (it.isLowerCase()) {
                ans += if (flag[it - 'a'] > 0) 1 else 0
            } else if (it.isUpperCase()) {
                ans += if (flag[it - 'A' + 26] > 0) 1 else 0
            }
        }
        return ans
    }
}