Coding/ZigZag.java at main · shr100/Coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
// Leetcode link : https://leetcode.com/problems/zigzag-conversion/
class Solution {
    public String convert(String s, int numRows) {

        if((s.length()==1)||(numRows==1)||(s.length()<=numRows)){
            return s;
        }

        String finalstr = "";
        if(s.length()%2==0){
            String[][] arr = new String[numRows][s.length()/2];
        String[] str = s.split("");

        int k=0,i=0,j=0;

        while((i<numRows)&&(j<arr[0].length)&&(k<s.length())){
            if(j%(numRows-1)==0){
                if(i>0){
                    i--;
                }
                while((i<numRows)&&(k<s.length())){
                arr[i][j] = str[k];
                k++;
                i++;
                }
                i--;
                j++;
            }
            else{
                i--;
                //j++;
                arr[i][j] = str[k];
                k++;
                j++;
            }
        }


        for(int h=0;h<numRows;h++){
            int l=0;
            while(l<arr[0].length){
                if(arr[h][l]!=null){
                finalstr = finalstr+arr[h][l];

                }
        l++;
            }
        }
        return finalstr;

        }
        else{
            String[][] arr = new String[numRows][(s.length()/2) + 1];
        String[] str = s.split("");

        int k=0,i=0,j=0;

        while((i<numRows)&&(j<arr[0].length)&&(k<s.length())){
            if(j%(numRows-1)==0){
                if(i>0){
                    i--;
                }
                while((i<numRows)&&(k<s.length())){
                arr[i][j] = str[k];
                k++;
                i++;
                }
                i--;
                j++;
            }
            else{
                i--;
                //j++;
                arr[i][j] = str[k];
                k++;
                j++;
            }
        }


        for(int h=0;h<numRows;h++){
            int l=0;
            while(l<arr[0].length){
                if(arr[h][l]!=null){
                finalstr = finalstr+arr[h][l];

                }
        l++;
            }
        }
        return finalstr;
        }
    }
}