POJ1226 Substrings，字符串，暴力，最长公共子串
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings....
分类：
其他好文 时间：
2015-06-01 22:48:24
阅读次数：
223
debug这么久hhhhhhh
话不多说 贴代码
#include
#include
using namespace std;
void Max_Heapify(int *a,int i,int _size)
{
int l,r,largest;
int temp;
l = 2*i;
r = 2*i+1;
if(la[i])...
分类：
编程语言 时间：
2015-06-01 22:39:37
阅读次数：
234
#include #include #include #define MAX 1000int cmp(char *s1,char *s2){ char temp1[100]; char temp2[100]; strcpy(temp1,s1); strcat(temp1,s2...
分类：
其他好文 时间：
2015-06-01 16:26:40
阅读次数：
113
public class Solution { public int findKthLargest(int[] nums, int k) { return find(nums,nums.length-k,0,nums.length-1); } public int f...
分类：
其他好文 时间：
2015-05-31 18:09:20
阅读次数：
110
Problem StatementYou have 16 bricks. Each brick has the shape of a rectangular box. You are given a vector height. For each i, one of your bricks has....
分类：
其他好文 时间：
2015-05-31 13:56:29
阅读次数：
137
In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56...
分类：
其他好文 时间：
2015-05-30 18:17:36
阅读次数：
121
题目：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2...
分类：
其他好文 时间：
2015-05-30 18:13:22
阅读次数：
130
Language:Largest Submatrix of All 1’sTime Limit:5000MSMemory Limit:131072KTotal Submissions:5185Accepted:1950Case Time Limit:2000MSDescriptionGiven am...
分类：
其他好文 时间：
2015-05-30 11:53:37
阅读次数：
131
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For examp...
分类：
编程语言 时间：
2015-05-30 07:05:25
阅读次数：
251
Maximum Product SubarrayTitle:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example,...
分类：
其他好文 时间：
2015-05-29 13:37:55
阅读次数：
98
