摘要:
题解抄自“http://simpleandstupid.com/2014/10/26/wildcard-matching-leetcode-%E8%A7%A3%E9%A2%98%E7%AC%94%E8%AE%B0/”“Implement wildcard pattern matching with ... 阅读全文
摘要:
依然觉得蛮无聊的,注意返回的是第n个(从1开始算起)stringThe count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off a... 阅读全文
摘要:
这道题最大的问题是位置容易想不清楚public class Solution { public int longestValidParentheses(String s) { // http://blog.csdn.net/linhuanmars/article/details/... 阅读全文
摘要:
不甚知道意义的题目,不过数组reverse值得复习一下哟public class Solution { public void nextPermutation(int[] num) { //这个题目意义何在啊唉 if (num==null || nu... 阅读全文
摘要:
Divide two integers without using multiplication, division and mod operator.比有趣在于1 提速过程 2怎么判断符号正负public class Solution { public int divide(int divi... 阅读全文
摘要:
https://www.youtube.com/watch?v=izMKq3epJ-QBoyer-Moore algrt 关于skip的部分很重要Implement strStr().Returns the index of the first occurrence of needle in hay... 阅读全文
摘要:
dfs 的一个关键是termination conditionpublic class Solution { public ArrayList generateParenthesis(int n) { ArrayList res = new ArrayList(); ... 阅读全文
摘要:
http://blog.kaggle.com/author/kevin-markham/ 阅读全文