zoukankan
html css js c++ java
简单的JsonHelper
package
utils;
import
java.util.ArrayList;
public
class
Json
{
public
static
void
main(String[] args)
{
Json json
=
new
Json();
json.reSet();
json.setSuccess(
true
);
for
(
int
n
=
0
; n
<
5
; n
++
)
{
json.addItem(
"
a
"
, n
+
"
a
"
);
json.addItem(
"
b
"
, n
+
"
b
"
);
json.addItem(
"
c
"
, n
+
"
c
"
);
json.addItem(
"
d
"
, n
+
"
c
"
);
json.addItem(
"
e
"
, n
+
"
e
"
);
json.addItem(
"
f
"
, n
+
"
f
"
);
json.addItemOk();
}
System.out.println(json.ToString());
}
public
String singleInfo
=
""
;
protected
boolean
_success
=
true
;
protected
String _error
=
""
;
protected
ArrayList arrData
=
new
ArrayList();
protected
ArrayList dataItem
=
new
ArrayList();
public
String getError()
{
return
_error;
}
public
void
setError(String error)
{
if
(
!
error.equals(
""
))
this
._success
=
false
;
this
._error
=
error;
}
public
boolean
getSuccess()
{
return
_success;
}
public
void
setSuccess(
boolean
success)
{
if
(success)
this
._error
=
""
;
this
._success
=
success;
}
public
Json()
{
}
public
void
reSet()
{
arrData.clear();
dataItem.clear();
}
public
void
addItem(String name, String _value)
{
dataItem.add(name);
dataItem.add(_value);
}
//
一个数组添加完毕,一个新的数组开始
public
void
addItemOk()
{
arrData.add(dataItem);
dataItem
=
new
ArrayList();
}
public
String ToString()
{
StringBuilder sb
=
new
StringBuilder();
//
sb.append("{");
//
sb.append("\"datas\":");
sb.append(
"
[
"
);
int
ad
=
arrData.size();
for
(
int
i
=
0
; i
<
ad; i
++
)
{
ArrayList arr
=
(ArrayList) (arrData.get(i));
sb.append(
"
{
"
);
int
t
=
arr.size();
for
(
int
j
=
0
; j
<
t; j
+=
2
)
{
if
(j
==
t)
break
;
sb.append(
"
\
""
);
sb.append(arr.get(j).toString());
sb.append(
"
\
""
);
sb.append(
"
:
"
);
sb.append(
"
\
""
);
sb.append(arr.get(j
+
1
).toString());
sb.append(
"
\
""
);
if
(j
<
t
-
2
)
sb.append(
"
,
"
);
}
sb.append(
"
}
"
);
if
(i
<
ad
-
1
)
sb.append(
"
,
"
);
}
sb.append(
"
]
"
);
//
sb.append("}");
return
sb.toString();
}
}
查看全文
相关阅读:
hadoop集群管理之 SecondaryNameNode和NameNode
无法fsck问题解决
处世
[THUSC2016]成绩单
Python安装官方whl包、tar.gz包、zip包
poj1159 Palindrome 动态规划
hoj1249 Optimal Array Multiplication Sequence 矩阵链乘
hoj分类(转)
hoj 2012 winter training Graph Day1 106 miles to Chicago图论最短路dijkstra算法
poj1050 To the Max
原文地址:https://www.cnblogs.com/meetrice/p/1217258.html
最新文章
LOJ3120「CTS2019 | CTSC2019」珍珠
HDU 2457
「HNOI2019」多边形(树形dp)
反演
ZOJ 3228
POJ 1204
[LOJ6538] 烷基计数加强版加强版
「NOI2019」机器人 (维护多项式dp值)
Linux系统Iptables防火墙
子网掩码网关网络地址广播地址
热门文章
DHCP伺服器介绍(转)
Linux/UNIX常用命令速查手册
linux 下ftp的上传与下载
(转)提高工作效率
ubuntu mysql远程连接
MySQL导出表结构
hive 三种启动方式及用途,关注通过jdbc连接的启动
ubuntu访问window7的共享文件
(转)Linux下用javaservice wrapper制作Java的Demon服务程序(系统服务程序)
(转)使用Java Service Wrapper将java程序作为linux服务并且开机自动启动
Copyright © 2011-2022 走看看