leetcode 6. ZigZag Conversion

    技术2025-12-02  17

    ZigZag Conversion class Solution { public String convert(String s, int numRows) { StringBuilder result = new StringBuilder(); int n = s.length(); if(n==1 || numRows==1){ return s; } int step = numRows+numRows-2; int width = numRows-2; for(int r=0;r<numRows;r++){ for(int i=r;i<n;i+=step){ result.append(s.charAt(i)); if(r==0 || r==numRows-1){ }else{ int left= width-r; int right=r-1; if(step-r+(i-r)<n){ result.append(s.charAt(step-r+(i-r))); } } } System.out.println(); } return result.toString(); } }
    Processed: 0.018, SQL: 9