Algorithm
文章平均质量分 69
Neo_邪风
这个作者很懒,什么都没留下…
展开
-
求数组中的最大连续和
求一数组中得最大连续数组和,除了Brute-force方法。翻译 2015-02-13 06:24:05 · 314 阅读 · 0 评论 -
Leetcode-33.Search in Rotated Sorted Array.
Problem description: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the原创 2016-01-13 04:13:28 · 273 阅读 · 0 评论 -
Leetcode-28.Implement strStr()
Problem description: Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Analysis: A classical problem with different ways to s原创 2015-12-27 05:56:56 · 368 阅读 · 0 评论 -
LCS
1. Longest Common Substring The Longest Common Substring (LCS) problem is as follows: Given two strings s and t, find the length of the longest string r, which is a substring of both s and t. Substr原创 2015-12-25 12:14:56 · 258 阅读 · 0 评论 -
Leetcode-14. Longest Common Prefix
Problem Description: Write a function to find the longest common prefix string amongst an array of strings.Analysis: It’s an easy problem. First pieces of code is regular solution. I try to use Trie原创 2016-01-08 11:20:14 · 388 阅读 · 0 评论 -
Leetcode-4.Median of Two Sorted Arrays
Problem Description : 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)).This li原创 2016-01-03 05:20:45 · 227 阅读 · 0 评论 -
Leetcode-52.N-Queens
Problem: 1. return the all configuration the vector of the chessborad 2. return the amount of of distinct solutionAnalysis: The idea is using DFS search with backtracking in recursive. We use a 1D原创 2016-01-02 04:31:13 · 204 阅读 · 0 评论 -
Leetcode-210.Course Schedule
Problem Description: There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which i原创 2015-12-31 23:43:14 · 202 阅读 · 0 评论 -
Binary Search
1.Easy binary search in a sort array without duplicate elementsint left=0;right=arr.size()-1;while(left <= right)//<= { int mid = left + ((right-left)>>1); int mid = left + (right原创 2015-09-28 04:58:34 · 233 阅读 · 0 评论 -
KMP (Knuth Morris Pratt) Pattern Searching
The KMP matching algorithm uses degenerating property (pattern having same sub-patterns appearing more than once in the pattern) of the pattern and improves the worst case complexity to O(n) The basic翻译 2015-09-11 10:54:31 · 458 阅读 · 0 评论 -
快速排序QuickSort
快速排序中比较快的版本void Qsort(int * numbers,int low,int high){ if(low<high) { int i=low+1,j=high; int ran; ran = (low + high) / 2; // swap(&numbers[ran], &numbers[low]); int原创 2015-04-11 09:51:56 · 333 阅读 · 0 评论 -
Biometric-----Fingerprint Recognition
1.Compute the orientation field of a fingerprint image Use Rao’s algorithm,based on gradient (I)Estimation of Orientation Field step 1. Smooth the input image use mean filter or Sobel ope原创 2015-09-08 22:55:31 · 886 阅读 · 0 评论 -
Biometric-----Face Recognition
Detecting Faces in Grayscale Images 1.Knowledge-based methods; 2.Feature invariant approaches;find nose or eyes, detect invariant features, edge shape texture shape … 3.Template matching methods;pu原创 2015-09-09 04:49:42 · 584 阅读 · 0 评论 -
median of two sorted arrays
Lots of online code have different bugshere is a non-bug code分析如果这道题的时间复杂度要求是O(m+n)的话, 就很简单了, 直接merge之后找出中位数即可。 如果时间复杂度要求为O(log(m+n))的话, 可以把这道题转化为求第k小的问题。1. 如果(m+n)是奇数的话, 中位数就是第(m+n)翻译 2015-05-21 10:00:25 · 305 阅读 · 0 评论 -
Leetcode-300.Longest Increasing Subsequence
//Problem description: Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [原创 2015-12-26 00:07:21 · 252 阅读 · 0 评论