A Code

Description 中文 English Given two sentences  words1 ,  words2  (each represented as an array of strings), and a list of similar word pairs  pairs , determine if two sentences are similar. For example,  words1 = great acting skills  and  words2 = fine drama talent  are similar, if the similar word pairs are  pairs = [["great", "fine"], ["acting","drama"], ["skills","talent"]] . Note that the similarity relation is not transitive. For example, if "great" and "fine" are similar, and "fine" and "good" are similar, "great" and "good" are  not  necessarily similar. However, similarity is symmetric. For example, "great" and "fine" being similar is the same as "fine" and "great" being similar. Also, a word is always similar with itself. For example, the sentences  words1 = ["great"], words2 = ["great...

class Solution { public:     /**      * @param s: input string      * @return: the longest palindromic substring      */     string longestPalindrome(string &s) {         // write your code here         int sizeS = s.size();         if(sizeS <= 1){             return s;         }         int maxLen = 0;         string res;         for(int i = 0; i < sizeS; i++){             //1，已i元素为中心             int wing = 1;             while(i - wing >= 0 && i + wing < sizeS && s[i - wing] == s[i + wing]){                 wing++;             }     ...