倪春恩的博客
offer-04 offer-04
/** 在一个 n * m 的二维数组中,每一行都按照从左到右 非递减 的顺序排序,每一列都按照从上到下 非递减 的顺序排序。请完成一个高效的函数,输入这样的一个二维数 组和一个整数,判断数组中是否含有该整数。 示例: 现
2022-11-29
offer-03 offer-03
/** 找出数组中重复的数字。 在一个长度为 n 的数组 nums 里的所有数字都在 0~n-1 的范围内。数组中某些数字是重复的,但不知道有几个数字重复了,也不知道每个数字重复了几次。请找出 数组中任意一个重复的数字。 示例
2022-11-24
lc-204 lc-204
/** Given an integer n, return the number of prime numbers that are strictly less than n. Example 1: Input: n
2022-11-21
lc-202 lc-202
/** Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following proce
2022-11-18
lc-217 lc-217
/** Given an integer array nums, return true if any value appears at least twice in the array, and return false if ever
2022-11-17
lc-149 lc-149
/** * Given an array of points where points[i] = [xi, yi] represents a point on the X- * Y plane, return the maximum n
2022-11-15
lc-140 lc-140
/** Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a
2022-11-14
lc-739 lc-739
/** Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[
2022-11-10
lc-647 lc-647
/** Given a string s, return the number of palindromic substrings in it. A string is a palindrome when it reads the s
2022-11-10
lc-621 lc-621
/** Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different t
2022-11-04
lc-617 lc-617
/** You are given two binary trees root1 and root2. Imagine that when you put one of them to cover the other, some no
2022-11-02
lc-581 lc-581
/** Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascendi
2022-11-01
32 / 39