Java Reference
In-Depth Information
for
for
(
int
int
k
=
1
;
k
<=
ch
;
k
++)
sb
.
append
(
A2R
[
i
][
1
]);
// I
}
else
else
if
(
ch
==
4
) {
sb
.
append
(
A2R
[
i
][
1
]);
// I
sb
.
append
(
A2R
[
i
][
2
]);
// V
}
else
else
if
(
ch
==
5
) {
sb
.
append
(
A2R
[
i
][
2
]);
// V
}
else
else
if
(
ch
<=
8
) {
sb
.
append
(
A2R
[
i
][
2
]);
// V
for
for
(
int
int
k
=
6
;
k
<=
ch
;
k
++)
sb
.
append
(
A2R
[
i
][
1
]);
// I
}
else
else
{
// 9
sb
.
append
(
A2R
[
i
][
1
]);
sb
.
append
(
A2R
[
i
][
3
]);
}
}
// fp.setBeginIndex(0);
// fp.setEndIndex(3);
return
return
sb
;
}
/** Parse a generic object, returning an Object */
public
public
Object
parseObject
(
String what
,
ParsePosition where
) {
int
int
n
=
0
;
for
for
(
char
char
ch
:
what
.
toUpperCase
().
toCharArray
()) {
for
for
(
R2A r
:
R2A
) {
iif
(
r
.
ch
==
ch
) {
n
+=
r
.
amount
;
break
break
;
}
}
}
return
return new
new
Long
(
n
);
}
/* Implement a toy stack */
protected
protected
int
int
stack
[] =
new
new
int
int
[
10
];
protected
protected
int
int
depth
=
0
;
/* Implement a toy stack */
protected
protected
void
int
n
) {
stack
[
depth
++] =
n
;
void
push
(
int
