您好,登錄后才能下訂單哦!
6. ZigZag Conversion
題目:https://leetcode.com/problems/zigzag-conversion/
string convert2(string s, int numRows) { if (s.length() < 2 || numRows < 2) return s; int cycle = 2 * numRows - 2; string tmp; string result; for (int i = 0; i < numRows; i++) { if (i == 0 || i == numRows - 1) { for (int j = 0; j < s.length(); j += cycle) { if (i + j < s.length()) tmp += s.at(i+j); } result += tmp; cout << tmp << endl; tmp.clear(); } else { int minus = numRows - i - 1; int j, j1; bool find = false; for (j = i, j1 = 0; j < s.length(); j += cycle, j1 += cycle) { tmp += s.at(j); if (!find) { j1 = j + 2 * minus; } if (j1 < s.length()) tmp += s.at(j1); } result += tmp; cout << tmp << endl; tmp.clear(); } } return result; }
2016-08-08 20:30:52
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。