规雨

每日一道编程题

Java-web开发(24) Java底层(1) Java项目实战(1) 会用决定下限，基础决定上限(5) 全栈-Java基础(13) 数据结构(8) 知识积累(8) 算法(1)

/ 注册

全部文章 / 每日一道编程题（共57篇）

49 Encode and Decode TinyURL

题目 Note: This is a companion problem to the System Design problem: Design TinyURL. TinyURL is a URL shortening service where you enter a URL such a...

2020-03-14

0 657

48 Insert into a Binary Search Tree

题目 Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of...

2020-03-13

0 384

47 Find a Corresponding Node of a Binary Tree in a Clone of That Tree

题目 Given two binary trees original and cloned and given a reference to a node target in the original tree. The cloned tree is a copy of the original...

2020-03-12

0 558

46 Count Negative Numbers in a Sorted Matrix

题目 Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise. Return the number of negative numbers in grid. ...

2020-03-11

0 427

45 Increasing Decreasing String

题目 Given a string s. You should re-order the string using the following algorithm: Pick the smallest character from s and append it to the result. P...

2020-03-10

0 521

44 Binary Search Tree to Greater Sum Tree

题目 Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the or...

2020-03-09

0 529

43 Max Increase to Keep City Skyline

题目 In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of a...

2020-03-07

0 479

42 Deepest Leaves Sum

题目 Given a binary tree, return the sum of values of its deepest leaves. Constraints: The number of nodes in the tree is between 1 and 10^4. The val...

2020-03-06

0 513

41 Group the People Given the Group Size They Belong To

题目 There are n people whose IDs go from 0 to n - 1 and each person belongs exactly to one group. Given the array groupSizes of length n telling the g...

2020-03-05

0 431

40 How Many Numbers Are Smaller Than the Current Number

题目 Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the...

2020-03-04

0 479