2014年03月_maverick1990

原创 priority_queue的用法

转自：http://www.cnblogs.com/flyoung2008/articles/2136485.htmlpriority_queue调用 STL里面的 make_heap(), pop_heap(), push_heap() 算法实现，也算是堆的另外一种形式。先写一个用 STL 里面堆算法实现的与真正的STL里面的 priority_queue用法相似的priority_

2014-03-28 17:08:07 1153

原创 leetcode-Valid Number

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo

2014-03-27 20:35:14 864

转载 leetcode-3Sum Closest

转自：http://www.cnblogs.com/remlostime/archive/2012/10/27/2742667.htmlGiven an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return th

2014-03-24 22:59:17 1077

转载 leetcode-Regular Expression Matching

Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st

2014-03-21 15:00:55 803

原创 leetcode-String to Integer (atoi)

mplement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cas

2014-03-20 17:23:17 729

原创 leetcode-ZigZag Conversion

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I

2014-03-19 23:35:19 1173

原创 leetcode-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.题意：寻找一个字符串的最

2014-03-19 22:04:32 926

转载浅谈manacher算法-O(n)时间内寻找最大回文子串

manacher算法是我在网上无意中找到的,主要是用来求某个字符串的最长回文子串.不过网上的版本还不太成熟,我就修改了下.不要被manacher这个名字吓倒了,其实manacher算法很简单,也很容易理解,程序短,时间复杂度为O(n).求最长回文子串这个问题,我听说有个分治+拓展kmp的算法,不过我估计后缀数组也可以.但杀鸡岂能用牛刀?现在进入正题:首先,在字符串s中,

2014-03-19 21:53:25 1028

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link

2014-03-18 17:04:43 673

原创 leetcode-Longest Substring Without Repeating Characters

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. Fo

2014-03-18 16:11:58 663

原创 leetcode-Median of Two Sorted Arrays

here are two sorted arrays A and B 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)).求两个已排序数组的中位数问题，数组长度分别为m,n,时间

2014-03-17 21:26:47 1104 1

转载求两个或多个已排序数组的中位数

转自：http://blog.163.com/zqz_20003/blog/static/26945430201091184713313/一道典型的面试题1,题目有两个数组,均已经按升序排列好,编程序计算这两个数组的中位数要求:要求时间复杂度O(lgn) 空间复杂度O(1) 例子: 数组A:{1,4,6,7,9} B{2,3,5,8} 两

2014-03-17 20:38:36 2213

翻译 Performance Issue Diagnosis for Online Service Systems

论文地址：http://research.microsoft.com/en-us/groups/sa/srds.pdf相关概念：服务等级目标（ServiceLevel Objective, SLO）：该域定义了服务请求者和服务的用户之间相互协定的服务等级。服务等级包含若干指标，诸如可用性、性能、可靠性等。服务等级的每一个方面都是一个需要实现的目标。服务

2014-03-02 23:56:49 1115

Maverick