CYH_job的博客

1.属于动态规划问题范畴 class NumArray { public:     vector num;     vector dp;        NumArray(vector nums) {         int n=nums.size();         dp=vector(n,0);          num=nums;         for(int

题目： Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. note： Each element in the result should appear

题目：Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate num

题目：给定两个数组，求数组的交集。输出结果中的元素唯一，输出数组可以无序。 solution：1.对两个数组分别进行排序                    2. 建立两个指针，分别指向两个数组的第一个数字，比较两个数字的大小，如果相等，并且不等于结果中最后一个数字则加入结果，否则将小的数字对应的指针往前移动一位。 遇到的问题：做了Intersection of Two Arrays II

题目： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in t

题目： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 思路：将三角形左边对齐后发现，除了

Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 思路：空间小了O（K

题目：Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). Example 1: Inpu