规雨

每日一道编程题

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

/ 注册

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

59 大数加法

leetcode上不了，做一下牛客网的题目以字符串的形式读入两个数字，再以字符串的形式输出两个数字的和。输入描述: 输入两行，表示两个数字a和b，-109 <= a , b <= 109 ，用双引号括起。输出描述: 输出a+b的值，用双引号括起。输入例子1: ...

2020-03-25

0 778

58 Balance a Binary Search Tree

题目 Given a binary search tree, return a balanced binary search tree with the same node values. A binary search tree is balanced if and only if the d...

2020-03-23

0 518

57 Find the Distance Value Between Two Arrays

题目 Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the...

2020-03-22

0 594

56 Height Checker

题目 Students are asked to stand in non-decreasing order of heights for an annual photo. Return the minimum number of students that must move in order...

2020-03-21

0 618

55 Construct Binary Search Tree from Preorder Traversal

题目 Return the root node of a binary search tree that matches the given preorder traversal. (Recall that a binary search tree is a binary tree where ...

2020-03-20

0 575

54 Minimum Number of Steps to Make Two Strings Anagram

题目 Given two equal-size strings s and t. In one step you can choose any character of t and replace it with another character. Return the minimum num...

2020-03-19

0 479

53 Lucky Numbers in a Matrix

题目 Given a m * n matrix of distinct numbers, return all lucky numbers in the matrix in any order. A lucky number is an element of the matrix such th...

2020-03-18

0 485

52 Generate a String With Characters That Have Odd Counts

题目 Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times. The returned string ...

2020-03-17

0 479

51 Sort the Matrix Diagonally

题目分析题意：给一个m*n矩阵，按对角线进行升序排序。将矩阵下标标出来解题关键在于如何找到“对角线”。我们人是可以直观看出来的，但是计算机不能。通过观察发现，<mark>对角线的元素必有：i-j相同</mark>。根据这个特性，实现对角遍历，将每个对...

2020-03-16

0 499

50 Maximum Binary Tree

题目 Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number in the arra...

2020-03-15

0 495