FilesExpand file tree

 master

/

DecodeString.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

50 lines (43 loc) · 994 Bytes

 master

/

DecodeString.java

Copy path

Top

File metadata and controls

• Code
• Blame

50 lines (43 loc) · 994 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package leetcode;

import java.util.Stack;

public class DecodeString {

public static void main(String[] args) {

DecodeString test = new DecodeString();

System.out.println(test.decodeString("3[a2[c]]"));

}

public String decodeString(String s) {

Stack<strNode> stack = new Stack<>();

stack.push(new strNode(1));

int n=0;

for(char c: s.toCharArray()){

if(Character.isDigit(c)){

int v= Integer.parseInt(""+c);

n = n*10+v;

}

if(c=='['){

stack.push(new strNode(n));

n=0;

}

if(Character.isAlphabetic(c)){

stack.peek().str.append(c);

}

if(c==']'){

int times= stack.peek().number;

String str = stack.pop().str.toString();

while(times>0){

stack.peek().str.append(str);

times--;

}

}

}

return stack.pop().str.toString();

}

class strNode{

int number;

StringBuilder str;

public strNode(int n){

number= n;

str = new StringBuilder();

}

}

}