算法
大郎,干了这碗毒鸡汤
这个作者很懒,什么都没留下…
展开
-
leetcode 509 斐波那契数列
这道题第一反应是用递归,但是递归时间复杂度会是2^n,且会有大量重复计算。考虑动态规划,倒过来从开头开始一个个计算即可。需要注意题目要求要模1000000007,且int可能会溢出。class Solution { public int fib(int n) { int[] fibArray = new int[n]; if(n == 0){ ...原创 2020-03-09 12:00:20 · 97 阅读 · 0 评论 -
LeetCode 665. Non-decreasing Array
问题描述:Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.We define an array is non-decreasing if array[i] <= array[i + 1] hold...原创 2019-01-05 05:19:27 · 134 阅读 · 0 评论 -
LeetCode 832. Flipping an Image
问题描述:Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.To flip an image horizontally means that each row of the image is reversed. Fo...原创 2019-01-05 10:21:22 · 135 阅读 · 1 评论 -
LeetCode 392.IsSequence
问题描述:Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) st...原创 2019-01-02 21:48:02 · 220 阅读 · 0 评论