- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 编程：等式变换
题目：输入一个正整数X，在下面的等式左边的数字之间添加+号或者-号，使得等式成立。 1 2 3 4 5 6 7 8 9 = X 比如： 12-34+5-67+89 = 5 1+23+4-5+6-7-8-9 = 5 请编写程序，统计满足输入整数的所有整数个数。 输入： 正整数，等式右边的数字 输出： 使该等式成立的个数 样例输入：5 样例输出：21分析：对于表
2016-03-28 11:47:33
725
原创 Leetcode 5. Longest Palindromic Substring（字符串）
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.Difficulty: Medium分析：寻找字符串中
2016-03-16 11:31:54
334
原创 Leetcode 3.Longest Substring Without Repeating Characters(hashmap)
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “
2016-03-15 15:14:07
446
原创 Leetcode 4. Median of Two Sorted Arrays（二分法）
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Difficulty: Hard对于两个排序数组，找出中位数
2016-03-14 23:35:13
542
原创 leetcode 82. Remove Duplicates from Sorted List II （线性表）
leetcode 82. Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2
2016-03-11 18:50:07
531
Fast Keypoint Recognition Using Random Ferns
2015-10-12
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人