yongheng5871的专栏

这道题是codechef上九月月赛的一道压轴题目，题意很简单，就是时时刻刻求一个字符串的所有不同字串个数，支持动态末尾添加字符与前端删除字符功能。题目链接： http://www.codechef.com/problems/TMP01/以前还以为后缀自动机可以秒杀一切字符串，后来才发现自己是那样的天真。       无论是后缀数组还是后缀树或者是后缀自动机，他们可以说都是处理字符串题目的一个非常强

ProblemYou 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

ProblemGiven 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

LeetCode 1: Two SumProblemGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add

ProblemThere 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)).AnswerComplexity: O(log

ProblemGiven 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.AnswerComplexity: O(

2015 计蒜客初赛题解标签（空格分隔）： ACM—题解思路工作区的颜值选择简单数据 暴力代码#include <iostream>#include <cstdio>using namespace std;const int Maxn = 2, Maxm = 3;int C[Maxn][Maxm], U[Maxn][Maxm], W[Maxn][Maxm];int n, m, k;i