Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
509. 斐波那契数 - 斐波那契数 (通常用 F(n) 表示)形成的序列称为 斐波那契数列 。该数列由 0 和 1 开始,后面的每一项数字都是前面两项数字的和。也就是: F(0) = 0,F(1) = 1 F(n) = F(n - 1) + F(n - 2),其中 n > 1 给定 n ,请计算 F(n) 。 示例 1: 输入
Question 4: Longest Continuous Increasing Subsequence(Leetcode-674) 题目描述 给定一个未经排序的整数数组,找到最长且连续的的递增序列。 示例1: 输入: [1,3,5,4,7] 输出: 3 解释: 最长连续递增序列是 [1,3,5], 长度为3。 尽管 [1,3,5,7] 也是升序的子序列, 但它不是连续的,因为5和7在原数组...
Question 560. 和为K的子数组 难度:简单 ❝ 给定一个整数数组和一个整数 k,你需要找到该数组中和为 k 的连续的子数组的个数。 示例1 : 代码语言:javascript 代码运行次数:0 运行 AI代码解释 输入:nums=[ 1,1,1],k=2输出: 2,[1,1]与[1,1]为两种不同的情况。 说明: 数组的长度为 [1, 20,00...
leetcode_question_115 Distinct Subsequences Given a stringSand a stringT, count the number of distinct subsequences ofTinS. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative ...
Number Range (medium) Search in a Sorted Infinite Array (medium) Minimum Difference Element (medium) Bitonic Array Maximum (easy) 12. Pattern: Top ‘K’ Elements,前K个系列 任何让我们求解最大/最小/最频繁的K个元素的题,都遵循这种模式。 用来记录这种前K类型的最佳数据结构就是堆了(译者注:在Java...
Question 6 Plus One Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. A trick here is if the carry remains 1 till the end, only the most significant bit is ...
转载自:LeetCode Question Difficulty Distribution 1 Two Sum 2 5 array sort set Two Pointers 2 Add Two Numbers 3 4 linked list Two Pointers Math 3 Longest Substring Without Repeating Characters 3 2 string Two Pointers hashtable 4 Median of Two Sorted Arrays 5 3 array Binary Search 5 Longest ...
IdQuestionDifficultyFrequencyData StructuresAlgorithms1Two Sum25array + setsort + two pointers2Add Two Numbers34linked listtwo pointers + math3Longest
DateQuestion Numbers✨ Star ! 数组和动态数组 73. Set Matrix Zeroes 48. Rotate Image 344. Reverse String 414. Third Maximum Number 448. Find All Numbers Disappeared in an Array 66. Plus One 238. Product of Array Except Self 697. Degree of an Array ...