![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
EasonDongH
这个作者很懒,什么都没留下…
展开
-
5047. Minimum Score Triangulation of Polygon
Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], …, A[N-1] in clockwise order. Suppose you triangulate the polygon into N-2 triangles. For each triangle, the value of tha...原创 2019-05-05 11:58:00 · 301 阅读 · 0 评论 -
5049. Moving Stones Until Consecutive II
On an infinite number line, the position of the i-th stone is given by stones[i]. Call a stone an endpoint stone if it has the smallest or largest position. Each turn, you pick up an endpoint stone a...原创 2019-05-05 11:59:47 · 357 阅读 · 0 评论 -
最长回文子串线性算法---Manacher(马拉车)
这位朋友的文章挺好的,请转:https://blog.csdn.net/happyrocking/article/details/82622881 LeetCode:5. Longest Palindromic Substring C++实现算法: class Solution { string preProcess(const string& s) { string ans; ...原创 2019-06-29 21:29:00 · 174 阅读 · 0 评论 -
LeetCode 81. Search in Rotated Sorted Array II
81. Search in Rotated Sorted Array II Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]). You are given...原创 2019-08-06 08:31:38 · 115 阅读 · 0 评论