2017年1月14日
【LeetCode】5. Longest Palindromic Substring
摘要： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example: 题意：求最长回文串。 思路：我是 阅读全文
posted @ 2017-01-14 18:58 wilderness 阅读(128) 评论(0) 推荐(0)
【LeetCode】36. Valid Sudoku
摘要： Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled wit 阅读全文
posted @ 2017-01-14 16:27 wilderness 阅读(150) 评论(0) 推荐(0)
【LeetCode】31. Next Permutation
摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2017-01-14 12:49 wilderness 阅读(138) 评论(0) 推荐(0)
【LeetCode】30. Substring with Concatenation of All Words
摘要： You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a conca 阅读全文
posted @ 2017-01-14 10:07 wilderness 阅读(159) 评论(0) 推荐(0)