题
思
leetcode815
就普普通通一道广搜的题,这也算困难吗
面试题17.17
我就把每个字母的位置都记录了一遍,一个个比对过去,居然也过了
代码
leetcode815
class Solution {
public int numBusesToDestination(int[][] routes, int source, int target) {
int minBuses = -1;
List<Set<Integer>> list = new ArrayList<Set<Integer>>();
for (int[] route : routes) {
Set<Integer> set = new HashSet<Integer>();
for (int stop : route) {
set.add(stop);
}
list.add(set);
}
boolean[] visited = new boolean[routes.length];
Queue<Integer> queue = new LinkedList<Integer>();
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
queue.offer(target);
map.put(target, 0);
while (!queue.isEmpty()) {
Integer stop = queue.poll();
if (stop == source) {
minBuses = map.get(stop);
break;
}
for (int i = 0; i < routes.length; i++) {
if (visited[i]) {
continue;
}
int[] route = routes[i];
if (list.get(i).contains(stop)) {
visited[i] = true;
for (int j = 0; j < route.length; j++) {
if (!map.containsKey(route[j])) {
queue.offer(route[j]);
map.put(route[j], map.get(stop) + 1);
}
}
}
}
}
return minBuses;
}
}
面试题17.17
class Solution {
public int[][] multiSearch(String big, String[] smalls) {
int[][] res = new int[smalls.length][];
Map<Character, Set<Integer>> map = new HashMap<Character, Set<Integer>>();
for (int i = 0; i < big.length(); i++) {
char c = big.charAt(i);
if (map.containsKey(c)) {
map.get(c).add(i);
} else {
Set<Integer> set = new HashSet<Integer>();
set.add(i);
map.put(c, set);
}
}
for (int i = 0; i < smalls.length; i++) {
String small = smalls[i];
if (small.length() < 1 || !map.containsKey(small.charAt(0))) {
res[i] = new int[0];
} else {
List<Integer> list = new ArrayList<Integer>();
for (Integer idx : map.get(small.charAt(0))) {
if (sameStr(big, small, idx)) {
list.add(idx);
}
}
res[i] = new int[list.size()];
for (int j = 0; j < list.size(); j++) {
res[i][j] = list.get(j);
}
Arrays.sort(res[i]);
}
}
return res;
}
private boolean sameStr(String big, String small, int idx) {
if (idx + small.length() > big.length()) {
return false;
}
for (int i = 0; i < small.length(); i++) {
if (small.charAt(i) != big.charAt(idx + i)) {
return false;
}
}
return true;
}
}