zoukankan      html  css  js  c++  java
  • leetcode--ZigZag Conversion

    The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

    P   A   H   N
    A P L S I I G
    Y   I   R
    

    And then read line by line: "PAHNAPLSIIGYIR"

    Write the code that will take a string and make this conversion given a number of rows:

    string convert(string text, int nRows);

    convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".

    public class Solution {
        public String convert(String s, int nRows) {
            int length = s.length();
            if(nRows == 0)
            	return null;
            if(length <= nRows  || nRows == 1)
            	return s;
            
            String[] zigzag = new String[nRows]; 
            for(int i = 0; i < nRows; ++i)
                zigzag[i] = "";
            int startIndex = 0;
            while(startIndex < length){
            	for(int j = 0 ; j < Math.min(length - startIndex, 2*nRows - 2); ++j){
            		if(j <  nRows)
            			zigzag[j] += s.substring(startIndex + j, startIndex + j + 1);
            		else
            			zigzag[2*nRows - 2 - j] +=  s.substring(startIndex + j, startIndex + j + 1);
            	}
            	startIndex += 2*nRows - 2;
            }
            
            //concatenate components
            String converted ="";        
            for(int i = 0; i < nRows; ++i)
            	converted += zigzag[i];        
            return converted;    
        }
    }
    

      

  • 相关阅读:
    19.模块化
    20.ES7新特性
    22.ES9
    21.ES8新特性
    RabbitMQ:排他性队列(Exclusive Queue)
    为什么要使用消息队列
    收集RabbitMQ的用户
    身份管理提供商:Gigya和PingIdentity
    HTTP协议原理(详细)
    转:Linux下高并发socket最大连接数所受的各种限制
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3809185.html
Copyright © 2011-2022 走看看