北京亚马逊 java职位笔试题 分析

综合了各位的意见，在jdk1.5下，实现了该算法，大家帮看看是否符合要求：

public class LogRecord { //日记记录

 private String trip1 = "";

 private String trip2 = "";

 private String trip3 = "";

 public String getTrip1() {
  return trip1;
 }

 public void setTrip1(String trip1) {
  this.trip1 = trip1;
 }

 public String getTrip2() {
  return trip2;
 }

 public void setTrip2(String trip2) {
  this.trip2 = trip2;
 }

 public String getTrip3() {
  return trip3;
 }

 public void setTrip3(String trip3) {
  this.trip3 = trip3;
 }

 @Override
 public boolean equals(Object obj) { //日志是否相等
  // TODO Auto-generated method stub
  if (this == obj)
   return true;
  if (obj == null)
   return false;
  if (getClass() != obj.getClass())
   return false;

  final LogRecord other = (LogRecord) obj;

  if (trip1.equals(other.trip1) && trip2.equals(other.trip2)
    && trip3.equals(other.trip3))
   return true;
  else
   return false;
 }

 @Override
 public String toString() {
  // TODO Auto-generated method stub
  return "[" + trip1 + "--" + trip2 + "--" + trip3 + "]";
 }

 public LogRecord(String trip1, String trip2, String trip3) {
  super();
  this.trip1 = trip1;
  this.trip2 = trip2;
  this.trip3 = trip3;
 }

 @Override
 public int hashCode() {    //计算hash值
  // TODO Auto-generated method stub
  final int prime = 31;
  int result = 1;
  result = prime * result + ((trip1 == null) ? 0 : trip1.hashCode());
  result = prime * result + ((trip2 == null) ? 0 : trip2.hashCode());
  result = prime * result + ((trip3 == null) ? 0 : trip3.hashCode());
  return result;

 }

}

主体类：

import java.util.ArrayList;
import java.util.HashMap;

public class Amason {

 private static HashMap<String, ArrayList> map = new HashMap<String, ArrayList>();
 private static HashMap<LogRecord, Integer> mapCount = new HashMap<LogRecord, Integer>();

 public static void Inital() { //初始化数据
  putPages("123", "home");
  putPages("234", "product spec");
  putPages("456", "support");
  putPages("123", "download center");
  putPages("456", "home");
  putPages("456", "download center");
  putPages("234", "download center");
  putPages("123", "support");
  putPages("456", "support");
 }

 public static void putPages(String userid, String page) {//把原始数据放到hashmap中
  if (map.get(userid) == null) {
   ArrayList<String> list = new ArrayList<String>();
   list.add(page);
   map.put(userid, list);
  } else {
   ArrayList<String> list = map.get(userid);
   list.add(page);
  }

 }

 public static void putRecord(LogRecord record) { //对每个用户的路径进行分析
  if (mapCount.get(record) == null) {
   mapCount.put(record, new Integer(1));
  } else {
   Integer count = mapCount.get(record);
   count = count + 1;
   mapCount.put(record, count);
  }
 }

 public static void putUserTrack() {

  for (String usrid : map.keySet()) {
   ArrayList<String> list = map.get(usrid);

   int size = list.size();
   if (size > 2) {
    for (int i = 0; i < size && i + 2 < size; i++) {  //路径是前后包含关系
     LogRecord record = new LogRecord(list.get(i), list
       .get(i + 1), list.get(i + 2));
     putRecord(record);
    }
   }
  }
 }

 public static void getCommonTrack() {  //简单打印出结果
  System.out.print(mapCount.keySet());
  System.out.print(mapCount.values());
 }

 public static void main(String[] args) {
  Inital();
  putUserTrack();
  getCommonTrack();
 }
}

大家帮看看，这样解决行不行？有没有更好的思路！！！！