2020年6月30日
0334. Increasing Triplet Subsequence (M)
摘要： Increasing Triplet Subsequence (M) 题目 Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formall 阅读全文
posted @ 2020-06-30 06:54 墨云黑 阅读(95) 评论(0) 推荐(0)
0350. Intersection of Two Arrays II (E)
摘要： Intersection of Two Arrays II (E) 题目 Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2 阅读全文
posted @ 2020-06-30 04:10 墨云黑 阅读(99) 评论(0) 推荐(0)
0047. Permutations II (M)
摘要： Permutations II (M) 题目 Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: Input: [1,1,2] O 阅读全文
posted @ 2020-06-30 03:33 墨云黑 阅读(112) 评论(0) 推荐(0)
0046. Permutations (M)
摘要： Permutations (M) 题目 Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2, 阅读全文
posted @ 2020-06-30 02:54 墨云黑 阅读(174) 评论(0) 推荐(0)
0045. Jump Game II (H)
摘要： Jump Game II (H) 题目 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array r 阅读全文
posted @ 2020-06-30 01:45 墨云黑 阅读(143) 评论(0) 推荐(0)