标签： 算法
-
970-强整数
给定两个非负整数 x 和 y，如果某一整数等于 x^i + y^j，其中整数 i >= 0 且 j &g…
-
KM算法学习笔记
增广路（augmenting path）：假设目前已有一个匹配结果，存在一组未匹配定点的OD，能够找到一条路径…
-
leetcode讲解–937. Reorder Log Files
You have an array of logs. Each log is a space delimite…
-
leetcode讲解–739. Daily Temperatures
Given a list of daily temperatures T, return a list suc…
-
区块链矿工挖矿交易的七个步骤
你有没有想过区块链的挖掘过程如何进行的，或者你的交易如何得到确认并添加到了区块链？好吧，我也是如此。由于我找不…
-
leetcode讲解–637. Average of Levels in Binary Tree
Given a non-empty binary tree, return the average value…
-
leetcode讲解–429. N-ary Tree Level Order Traversal
Given an n-ary tree, return the level order traversal o…
-
leetcode讲解–513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the las…
-
leetcode讲解–946. Validate Stack Sequences
Given two sequences pushed and popped with distinct val…
-
leetcode讲解–953. Verifying an Alien Dictionary
In an alien language, surprisingly they also use englis…