循环嵌套判断字符串是否相等

for (int j = 0; j < pidList.length; j++) {
					// 存入map当中
					for (int i = 0; i < stationhour.size(); i++) {
						if (pidList[j].equals(stationhour.get(i).getPtid())) {

							pollValueMap = new TreeMap<String, String>();
							pollValueMap.put("monitordate", stationhour.get(i)
									.getDatatime() + "");
							pollValueMap.put("stationCode", stationhour.get(i)
									.getPtid() + "");
							pollValueMap.put("so2_1h", stationhour.get(i)
									.getValue_4402() + "");
							pollValueMap.put("no2_1h", stationhour.get(i)
									.getValue_4467() + "");
							pollValueMap.put("pm10_1h", stationhour.get(i)
									.getValue_4486() + "");
							pollValueMap.put("co_1h", stationhour.get(i)
									.getValue_4404() + "");
							pollValueMap.put("o3_1h", stationhour.get(i)
									.getValue_4471() + "");
							// pollValueMap.put("o3_m1",
							// stationhour.get(i).getValue_()+"");
							pollValueMap.put("pm25_1h", stationhour.get(i)
									.getValue_4468() + "");
							String dateKey = DateTimeUtils.handle(stationhour
									.get(i).getDatatime())
									+ "@"
									+ stationhour.get(i).getPtid();
							hourMap.put(dateKey, pollValueMap);
							pollValueMap = null;
						} else {
							continue;
						}

					}
				}