摘要：
Validate if a given string is numeric.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>true题解：题目不难，就是有点麻烦，要注意的地方很多，总结一下：前面和后面的空格要用s... 阅读全文
摘要：
Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18].题解：首先对所有的区间按照s... 阅读全文
摘要：
Implement strStr().Returns a pointer to the first occurrence of needle in haystack, ornullif needle is not part of haystack.暴力法，从haystack第一个字符开始查找need... 阅读全文
摘要：
Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL.题解：首先... 阅读全文
摘要：
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.题解：最开始用了最naive的方法，每次在k个链表头中找出最小的元素，插入到新链表中。结果果断TLE了。分析... 阅读全文
摘要：
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
摘要：
Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation... 阅读全文
摘要：
Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.题解：所谓的anagrams，只若干个词，它们包含的字母的个数和种类完全一... 阅读全文
摘要：
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
摘要：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文