Вообщем реализовал подсчет результата из польской записи,
| Java |
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
| package qwerqwre;
import java.util.Scanner;
import java.util.Stack;
public class llll {
public static void main(String[] args)
{
Stack <Integer> stack = new Stack();// = new Stack;
Scanner in = new Scanner(System.in);
String [] s = in.nextLine().split(" ");
for(int i = 0; i < s.length; i++)
{
if (s[i].equals("+"))
{
int a = stack.pop();
int b = stack.pop();
stack.push(a+b);
} else if (s[i].equals("-"))
{
int a = stack.pop();
int b = stack.pop();
stack.push(b-a);
} else if (s[i].equals("*"))
{
int a = stack.pop();
int b = stack.pop();
stack.push(a*b);
} else if (s[i].equals("/"))
{
int a = stack.pop();
int b = stack.pop();
stack.push(b/a);
} else stack.push(Integer.parseInt(s[i]));
}
System.out.println(stack.pop());
} |
|
Далее стал описывать саму реализацию преобразования в польскую
и вообщем не получается
| Java |
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
| public class preobraz {
public final static String LexPusto = "LexPusto";
public final static String LexPlus = "LexPlus";
public final static String LexMinus = "LexMinus";
public static final String LexChislo = "LexChislo";
public static final String Lexymn = "Lexymn";
public static final String Lexdel = "Lexdel";
public static final String LexRavno = "LexRavno";
char[] a;
String[] s;
String[] out;
int n;
preobraz(char[] b){
a=b;
}
public String next(int b) {
String result = "";
if (a[b] >= '0' && a[b] <= '9') {
result = LexChislo;
}
if (a[b] == '+')
{
result = LexPlus;
}
if (a[b] == 'x')
{
result = Lexymn;
}
if (a[b] == '-') {
result = LexMinus;
}
if (a[b] == ' ') {
result = LexPusto;
}
System.out.print(result);
return result;
}
public String[] getPreobr() {
out = new String[n*12];
int k = 0;
String s = "";
for (int i = 0; i < a.length; i++) {
if (next(i) == LexPusto)
continue;
if (next(i) == LexChislo)
s = s + a[i];
else
if (i == a.length - 1 && s != "")
out[k] = s;
}
return out;
}
} |
|
(
