Keep Learning

摘要： import java.util.* /** * 378. Kth Smallest Element in a Sorted Matrix * https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/ * * Given a n x n matrix where each of ... 阅读全文

摘要： package LeetCode_240 /** * 240. Search a 2D Matrix II * https://leetcode.com/problems/search-a-2d-matrix-ii/description/ * * Write an efficient algorithm that searches for a value in an m x n ma... 阅读全文

摘要： /** * 74. Search a 2D Matrix * https://leetcode.com/problems/search-a-2d-matrix/description/ * * Write an efficient algorithm that searches for a value in an m x n matrix. * This matrix has the follow 阅读全文

摘要： /** * 743. Network Delay Time * https://leetcode.com/problems/network-delay-time/description/ * https://blog.csdn.net/afei__/article/details/83780362 阅读全文

摘要： 学习Dijkstras算法 一、简介 Dijkstras算法是典型的单源最短路径算法。用于计算一个节点到其它所有节点的最短路经。主要特点是以起点为中心向外层层扩展，直到扩展到终点为止。即解决有权重的有向图单源最短路经的问题。 该算法有一个艰制就是：所有边的权重都必需为非负数。 问题描述：在无向图G= 阅读全文

摘要： 题目： /** * 315. Count of Smaller Numbers After Self * https://leetcode.com/problems/count-of-smaller-numbers-after-self/description/ * https://www.cnbl 阅读全文

摘要： /** * 922. Sort Array By Parity II *https://leetcode.com/problems/sort-array-by-parity-ii/description/ * * Given an array A of non-negative integers, half of the integers in A are odd, and half o... 阅读全文

摘要： import java.lang.StringBuilder /** * 179. Largest Number * https://leetcode.com/problems/largest-number/description/ * https://www.cnblogs.com/grandyang/p/4225047.html * * Given a list of non negative 阅读全文

摘要： quicksort是一个comparison-based的排序算法（heap sort，merge sort，插入都是） 阅读全文

摘要： import java.util.* import kotlin.collections.HashMap /** * 1161. Maximum Level Sum of a Binary Tree * https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/description/ * */ class Tree... 阅读全文