两个List 遍历算法
List list1 = new ArrayList();
List list2 = new ArrayList();
...
int maxSize = 0;
if(list1 != null && list2 != null) {
maxSize = Integer.max(list1.size(), list2.size());
}
Response response = new Response();
List<SingleResponse> singleResponses = response.getSingleResponses();
for(int i = 0; i < maxSize; i++) {
SingleResponse singleResponse = new SingleResponses();
Object data1 = list1.get(i);
Object data2 = list2.get(i);
singleResponse.setInputData(data1);
singleResponse.setCurrentData(data2);
}
Class Response {
List<SingleResponse> singleResponses = new ArrayList();
}
Class SingleResponse {
Object inputData;
Object currentData;
}