Manachar’s AlgorithmLongest palindromic substring - Wikipedia https://en.wikipedia.org/wiki/Longest_palindromic_substringLongest palindromic substringFrom Wikipedia, the free encyclopedia Jump to n
Kadane's Algorithmis anO(n)algorithm for finding the maximum contiguoussubsequencein a one-dimensionalsequence.[edit]PseudocodeThe algorithm keeps track of the tentative maximum subsequence in(maxSum, maxStartIndex, maxEndIndex). It accumulates a partial sum incurrentMaxSumand updates the optima
An Attempt to Understand Boosting Algorithm(s)WELCOME!Here you will find dailynews and tutorials about R, contributed by over 573 bloggers.There are m...
You may refer to the main idea of MST in graph theory.http://en.wikipedia.org/wiki/Minimum_spanning_tree Here is my own interpretationWhat is Minimum Spanning
冒泡排序def bubble_sort(li):
for i in range(len(li)-1): # i表示第几趟
for j in range(len(li)-i-1): # j表示图中的箭头
if li[j] > li[j+1]:
li[j], li[j+1] = li[j+1], li[j]
===
前言 用的不熟练千万别用。 前置芝士：链式前向星 这玩意是个啥呢？先别着急，先上代码，再慢慢讲。 int head[MAXN]; struct Node{//定义 long long to/*终点*/,dis/*权值*/,next/*上一个next的下标*/; }edge[3000001]; voi ...
