問題 https://leetcode.com/problems/zigzag-conversion/ 答え class Solution { public: string convert(string s, int numRows) { if(numRows == 1) { return s; } vector<string> rows(min(numRows, int(s.size()))); int currentRow = 0; bool goingDown = false</string>…

Problem https://leetcode.com/problems/longest-palindromic-substring/ Answer O(N3) class Solution { private: bool check(string &subString, int subStringSize){ int i = 0; while(i < j) { if(subString[i] != subString[j]) { return false; } i++;…