leetcode
unshaven111
这个作者很懒,什么都没留下…
展开
-
467. Unique Substrings in Wraparound String
PremiumNew PlaygroundunshavenUnique Substrings in Wraparound String@TOCConsider the string s to be the infinite wraparound string of “abcdefghijklmnopqrstuvwxyz”, so s will look like this: “…zabc...原创 2018-10-23 21:45:24 · 89 阅读 · 0 评论 -
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 1:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.Example ...原创 2018-11-20 15:06:31 · 144 阅读 · 0 评论 -
kmp算法
Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Example 1:Input: haystack = “hello”, needle = “ll”Output: 2Example 2:In...原创 2018-11-20 20:38:35 · 91 阅读 · 0 评论 -
102. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7],3/ 9 20/ 15 7retu...原创 2018-12-04 16:15:48 · 83 阅读 · 0 评论