算法
andrew_blc
这个作者很懒,什么都没留下…
展开
-
substring-with-concatenation-of-all-words
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 an...原创 2017-09-21 17:19:13 · 258 阅读 · 0 评论 -
convert-sorted-list-to-binary-search-tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.class TreeNode(object): def __init__(self, val, left=None, right=None): self.d原创 2017-09-22 13:57:19 · 230 阅读 · 0 评论 -
copy-list-with-random-pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.class Node(object): def _原创 2017-09-22 13:18:38 · 158 阅读 · 0 评论 -
palindrome-number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Determine whether an integer is a palindrome. Do this without extra space.click to show s原创 2017-09-21 23:13:33 · 164 阅读 · 0 评论 -
valid-palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama"is a palindrome."race a car"is not a pa原创 2017-09-21 23:05:30 · 170 阅读 · 0 评论 -
palindrome-partitioning-ii
Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s ="aab",Retur原创 2017-09-21 22:13:08 · 176 阅读 · 0 评论 -
palindrome-partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s ="aab",Return [ ["aa","b原创 2017-09-21 21:06:30 · 145 阅读 · 0 评论 -
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, and there exists one unique longest palindromic substring.def longestPalin原创 2017-09-21 18:43:46 · 151 阅读 · 0 评论 -
longest-substring-without-repeating-characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2017-09-21 17:38:15 · 193 阅读 · 0 评论 -
sort-list
Sort a linked list in O(n log n) time using constant space complexity.class Solution(object): def mergeTwoLists(self, left, right): if left == None: return left if right == None:原创 2017-09-22 14:46:33 · 178 阅读 · 0 评论