mysterious_i的博客

/*Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", w

//最长回文，可以将字符串从中间拆开，按左右两部分，一个向左移一个向右移进行对称匹配，每次移动都以移动到的点为哨兵位置，进行对称匹配class Solution {public: string longestPalindrome(string s) { int solder = s.length() / 2; string longest_str = ""; longest_s...