weixin_51979465的博客

近些日子用二分用的比较多，用的时候都是现推模板，还有时候推错，现在就整理一个二分模板吧，这个模板灵感来自于我东哥，下面先看一下代码吧int l,r ans = -1;while(l <= r){ int mid = l + r >> 1; if(check(mid)) r = mid - 1,ans = mid; else l = mid + 1;}他这样记录的是最后一个满足条件的，因为二分的目的是找check函数 0 和 1 的分界线，他这样找到的是0000011111中

PalindromeDescriptionAndy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, “Can you propose an efficient algorithm to find the length of the largest palindrome in a string?”A s