6. ZigZag Conversion

最新推荐文章于 2023-12-09 16:08:49 发布

purple尘

最新推荐文章于 2023-12-09 16:08:49 发布

阅读量216

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/csCrazybing/article/details/78641279

版权

LeetCode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

水题。

class Solution {                                
    public:                                     
        string convert(string s, int numRows) { 
                                                
            if (1 == numRows) {                 
                return s;                       
            }                                   
                                                
            vector<string> v_s(numRows);        
                                                
            int length = s.length();            
            int next_line = 0;                  
            bool direction = true;              
            for (int idx = 0; idx < length; idx++) {
                v_s[next_line] = v_s[next_line] + s[idx];
                                                
                if (direction) {                
                    next_line++;                
                } else {                        
                    next_line--;                
                }                               
                                                
                if (next_line >= numRows) {        
                    direction = !direction;        
                    next_line -= 2;             
                }                               
                                                
                if (next_line < 0) {            
                    direction = !direction;        
                    next_line += 2;             
                }                               
            }                                   
                                                
            string result;                      
            for (int idx = 0; idx < numRows; idx++) {
                result += v_s[idx];             
            }                                   
                                                
            return result;                      
        }                                       
};