圆和矩形是否重叠leetcode-Algorithm-Notes:关于Leetcode、Lintcode编码问题的注意事项

圆和椭圆重叠代码 内容 破解算法面试 /* * * @param s: a string which consists of lowercase or uppercase letters * @return: the length of the longest palindromes that can be built */ int longestPalindrome (string & s) { int result = 0 ; bool hasOdd = false ; std::unordered_map< char , int > count; for ( char ch: s) { ++count[ch]; } for (std::unordered_map< char , int >::iterator it = count. begin (); it != count. end ();++it) { if (it-> second % 2 == 0 ) { result += it-> second ; } else { hasOdd = true ; result +=