谷歌笔试最后一题

接上次的，google 2011校招清华笔试最后一题题目（感觉在考MapReduce思想和动态规划）：

 

KOF游戏中一个大招规则如下：S->T, S与T分别为按键集合。当按键满足一定规则时，可以连续按出大招，即连招。

例如招数表如下：ABC->D, BCD->E, DE->F, EF->G。那么，当按键顺序为：ABC->D->E->F->G 时，可以输出一个最长连招。

现给定一组招数，求出其中的最长连招。如可以无限连招，输出一个特定数字，否则输出最长连招长度。

 

我的思路：

 

对于一招S->T, 假设T的长度为1（不为1也可以，写法稍有变化), S长度为m。如果这一招可以连上之前的招数，那么它的m前缀一定等于某一个或多个其它招数的m后缀。这样，我们可以先扫描一遍所有招数，看看有多少种m；然后通过map过程对每个招数建立各个m后缀的索引，然后通过reduce过程，把对应的后缀与前缀的招数连起来，形成一张图。剩下的步骤，就可以利用动态规划求最长链或环了。

 

代码如下，夜里写的，没怎么写注释。。。对于复杂度，如果招数的数量N远大于招数的长度M的话，那么时间复杂度应该是O(N)的。

 

import java.util.Collections; import java.util.Hashtable; import java.util.Iterator; import java.util.LinkedList; import java.util.List; public class KOF { //infinite tricks private final int DEF = -999; public List<Integer> getNumOfPrefix(String[] tricks){ List<Integer> list = new LinkedList(); Hashtable<Integer, Boolean> table = new Hashtable(); for(int i=0;i<tricks.length;i++){ table.put(tricks[i].lastIndexOf("-"), true); } Iterator itr = table.keySet().iterator(); while(itr.hasNext()){ list.add((Integer)itr.next()); } Collections.sort(list); return list; } public Hashtable<String,List<Integer>> map(String[] tricks, List<Integer> prefixNum){ Hashtable<String, List<Integer>> table = new Hashtable(); for(int i=0;i<tricks.length;i++){ String curStr = tricks[i]; int pos = curStr.lastIndexOf("-"); int num = prefixNum.size(); String suffix = "";//curStr.substring(curStr.length()-1); int j=0; while(pos>=0 && j<num && suffix.length()<prefixNum.get(j)){ if(suffix.length() == 0){ suffix = curStr.substring(curStr.length()-1); } else{ suffix = String.valueOf(curStr.charAt(pos)) + suffix; } if(suffix.length() == prefixNum.get(j)){ if(!table.containsKey(suffix)){ List<Integer> list = new LinkedList(); list.add(i); table.put(suffix, list); } else{ List<Integer> list = table.get(suffix); list.add(i); table.put(suffix, list); } j++; } pos--; } } return table; } public List<Integer>[] reduce(String[] tricks, Hashtable<String, List<Integer>> mapTable){ List<Integer>[] reduceTable = new List[tricks.length]; for(int i=0;i<tricks.length;i++){ reduceTable[i] = null; } for(int i=0;i<tricks.length;i++){ String curStr = tricks[i]; int pos = curStr.lastIndexOf("-"); String prefix = curStr.substring(0,pos); if(mapTable.containsKey(prefix)){ List<Integer> inNodeList = mapTable.get(prefix); for(int j=0;j<inNodeList.size();j++){ int nodeID = inNodeList.get(j); if(reduceTable[nodeID] == null){ reduceTable[nodeID] = new LinkedList<Integer>(); } reduceTable[nodeID].add(i); } } } return reduceTable; } public int findLongestTricks(List<Integer>[] reduceTable, int[] maxLen, int[] maxNode, int curNode, boolean[] reg){ //terminal condition if(reduceTable[curNode] == null){ maxLen[curNode] = 1; maxNode[curNode] = -1; return 1; } //check loop if(reg[curNode]){ return DEF; } //avoid repeated search if(maxLen[curNode] != -1){ return maxLen[curNode]; } reg[curNode] = true; List<Integer> outList = reduceTable[curNode]; for(int i=0;i<outList.size();i++){ int nextNode = outList.get(i); int tempLen = findLongestTricks(reduceTable, maxLen, maxNode, nextNode, reg); if(tempLen == DEF){ maxLen[curNode] = DEF; maxNode[curNode] = nextNode; } else{ if(tempLen+1 > maxLen[curNode]){ maxLen[curNode] = tempLen+1; maxNode[curNode] = nextNode; } } } reg[curNode] = false; return maxLen[curNode]; } public static void main(String[] args){ String[] tricks = {"BCD->E","DE->C","EDD->E","AAA->A","E->F","EF->G","ABC->D"}; KOF kof = new KOF(); List<Integer> list = kof.getNumOfPrefix(tricks); for(int i=0;i<list.size();i++){ System.out.println(list.get(i)); } System.out.println("******************************"); Hashtable<String, List<Integer>> mapTable = kof.map(tricks, list); //test Iterator itr = mapTable.keySet().iterator(); while(itr.hasNext()){ String keyStr = (String)itr.next(); System.out.print(keyStr+": "); List<Integer> tempList = mapTable.get(keyStr); for(int i=0;i<tempList.size();i++){ System.out.print(tempList.get(i)+", "); } System.out.println(); } System.out.println("******************************"); List<Integer>[] reduceTable = kof.reduce(tricks, mapTable); for(int i=0;i<tricks.length;i++){ System.out.print(tricks[i]+", out: "); if(reduceTable[i] == null){ System.out.print("empty; "); } else{ List<Integer> outNodeList = reduceTable[i]; for(int j=0;j<outNodeList.size();j++){ System.out.print(outNodeList.get(j)+", "); } } System.out.println(); } System.out.println("******************************"); int[] maxLen = new int[tricks.length]; int[] maxNode = new int[tricks.length]; boolean[] reg = new boolean[tricks.length]; for(int i=0;i<tricks.length;i++){ maxLen[i] = -1; maxNode[i] = -1; reg[i] = false; } for(int i=0;i<tricks.length;i++){ kof.findLongestTricks(reduceTable,maxLen,maxNode,i,reg); } for(int i=0;i<tricks.length;i++){ System.out.println(tricks[i]+", maxLen: "+maxLen[i]+", maxNode: "+maxNode[i]); } } }