-
https://leetcode.com/problems/car-fleet/ N cars are going to the same destination along a one lane road. The destination is target ...
-
-
Longest Common Increasing Subsequence (LCS + LIS) - GeeksforGeeks Given two arrays, find length of the longest common increasing subseque...
-
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate ext...
-
随机的力量(2) - 矩阵比较 最直接的想法,当然是先进行矩阵乘法得到矩阵D = A×B,然后再一一比较矩阵C和矩阵D是否相同? 比较两个n×n矩阵是否相同的时间复杂度为O(N^2),而矩阵乘法直接算法时间复杂度是O(N^3), 目前最快的矩阵乘法的时间复杂度是O(N^...
-
https://leetcode.com/problems/convert-to-base-2/ Given a number N , return a string consisting of "0" s and "1" ...
-
Serialize and Deserialize an N-ary Tree https://blog.csdn.net/roufoo/article/details/81777409 http://yuanyuanzhangcs.blogspot.com/2017/02...
-
Uber-NY Onsite "噢你很懂design?"【一亩三分地论坛面经版】 - Powered by Discuz! 1,常见题-Design spotify,主要在问playlist和shuffle list功能。 >player,play...
-
http://www.1point3acres.com/bbs/thread-190801-1-1.html input : abbaba4x[a]bb3x[abaa2x[bab]] output : abbabaaaaabbabaababbababaababbababaab...
-
Smallest subarray with sum greater than a given value | GeeksforGeeks Given an array of positive integers and a number positive x, f...