- The Modern C++ Challenge
- Marius Bancila
- 39字
- 2021-06-25 22:01:29
28. Longest palindromic substring
Write a function that, given an input string, locates and returns the longest sequence in the string that is a palindrome. If multiple palindromes of the same length exist, the first one should be returned.
推薦閱讀
- 極簡(jiǎn)算法史:從數(shù)學(xué)到機(jī)器的故事
- Advanced Quantitative Finance with C++
- C程序設(shè)計(jì)簡(jiǎn)明教程(第二版)
- Vue.js快跑:構(gòu)建觸手可及的高性能Web應(yīng)用
- Processing互動(dòng)編程藝術(shù)
- Windows Server 2012 Unified Remote Access Planning and Deployment
- Clean Code in C#
- Bootstrap for Rails
- Webpack實(shí)戰(zhàn):入門、進(jìn)階與調(diào)優(yōu)(第2版)
- Julia數(shù)據(jù)科學(xué)應(yīng)用
- 寫給大家看的Midjourney設(shè)計(jì)書
- Arduino機(jī)器人系統(tǒng)設(shè)計(jì)及開發(fā)
- C語(yǔ)言從入門到精通
- Oracle Database XE 11gR2 Jump Start Guide
- Keil Cx51 V7.0單片機(jī)高級(jí)語(yǔ)言編程與μVision2應(yīng)用實(shí)踐