程序媛詹妮弗
终身学习
上一页 1 ··· 19 20 21 22 23 24 25 26 27 ··· 30 下一页
摘要: Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: "eceba" Output: 3 Explana 阅读全文
posted @ 2018-06-20 03:37 程序媛詹妮弗 阅读(119) 评论(0) 推荐(0) 编辑
摘要: Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2018-06-20 03:24 程序媛詹妮弗 阅读(186) 评论(0) 推荐(0) 编辑
摘要: Given a collection of distinct integers, return all possible permutations. 题意: 打印全排列 Solution1: Backtracking 形式化的表示递归过程:permutations(nums[0...n-1]) = 阅读全文
posted @ 2018-06-20 02:58 程序媛詹妮弗 阅读(248) 评论(0) 推荐(0) 编辑
摘要: Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper], return its missing ranges. Example: 题意: 给定一个 阅读全文
posted @ 2018-06-20 02:31 程序媛詹妮弗 阅读(163) 评论(0) 推荐(0) 编辑
摘要: Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Example 2: 题意: 给定一个数组,统计其中元素的区间分布。 思路: scan给定数组 若当前数字 = 阅读全文
posted @ 2018-06-20 02:25 程序媛詹妮弗 阅读(276) 评论(0) 推荐(0) 编辑
摘要: Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set must not conta 阅读全文
posted @ 2018-06-16 21:36 程序媛詹妮弗 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Exampl 阅读全文
posted @ 2018-06-16 10:30 程序媛詹妮弗 阅读(148) 评论(0) 推荐(0) 编辑
摘要: Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to le 阅读全文
posted @ 2018-06-16 07:51 程序媛詹妮弗 阅读(178) 评论(0) 推荐(0) 编辑
摘要: Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two 阅读全文
posted @ 2018-06-16 05:16 程序媛詹妮弗 阅读(180) 评论(0) 推荐(0) 编辑
摘要: Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k num 阅读全文
posted @ 2018-06-16 03:42 程序媛詹妮弗 阅读(213) 评论(0) 推荐(0) 编辑
上一页 1 ··· 19 20 21 22 23 24 25 26 27 ··· 30 下一页