发布时间：2015-04-16 11:15:58
//You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.import java.util.ArrayList;import java.util.HashMap;import java.util.L.........【阅读全文】
发布时间：2015-04-15 10:39:37
import java.io.File;import java.io.FileNotFoundException;import java.util.ArrayList;import java.util.Scanner;public class RemoveIndex {public static void main(String[] args) {// TODO 自动生成的方法存根Scanner s = null;try {s = new Scanner(new File("F:\\输入.txt"));} catch (FileNotFound.........【阅读全文】
发布时间：2015-04-13 14:26:42
//Divide Two Integers Total Accepted: 34192 Total Submissions: 223949 My Submissions Question Solution //Divide two integers without using multiplication, division and mod operator.////If it is overflow, return MAX_INT.下面时申请动态数组来存 divisor*2^i的值，以便来与dividend进行比较来确定.........【阅读全文】
发布时间：2015-04-09 20:27:25
//Implement strStr() Total Accepted: 46286 Total Submissions: 209890 My Submissions Question Solution //Implement strStr().////Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.public class ImplementstrStr {public static void main(St.........【阅读全文】
发布时间：2015-04-09 12:24:02
//Remove Element Total Accepted: 50575 Total Submissions: 155945 My Submissions Question Solution //Given an array and a value, remove all instances of that value in place and return the new length.////The order of elements can be changed. It doesn't matter what you leave beyond the new leng.........【阅读全文】
