lycronaldo的博客

有关于leetcode的刷题记录。这次是124题。首先看题干：···Given anon-emptybinary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in th...

先上题： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example: Given n = 13, Return 6, because digit 1 occurred in the followi

LeetCode的这个问题可用“夹逼”的思想完成。 题目如下 Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from le

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Example:Given

考试前刷一波leetcode。这次的问题依然是简单的，但是处理方式极为麻烦，因为涉及到了单向链表的反转操作。C++有个规律：一旦涉及到指针和链表的东西，绝对会有无数的边界情况和细节在等着你。先上题：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If

首先是题目：Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start