- 博客(13)
- 问答 (1)
- 收藏
- 关注
原创 DAY13:leetcode #28 Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Subscribe to see which companies asked this question class Solu
2016-07-28 11:10:17 252
原创 DAY13:leetcode #27 Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.
2016-07-28 10:32:37 189
原创 DAY12:leetcode #26 Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with
2016-07-27 16:42:04 192
原创 DAY12:leetcode #24 Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. Y
2016-07-27 11:04:47 216
原创 DAY11:leetcode #23 Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Subscribe to see which companies asked this question # Definition for singly-linked list. # c
2016-07-26 10:57:08 279
原创 DAY10:leetcode #22 Valid Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())
2016-07-25 15:46:40 218
原创 DAY9:leetcode #21 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Subscribe to see which companies asked this questio
2016-07-22 16:25:14 198
原创 DAY9:leetcode #20 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all va
2016-07-22 16:15:17 217
原创 DAY9:leetcode #19 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the
2016-07-22 16:02:32 222
原创 DAY8:leetcode #17 Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st
2016-07-13 19:04:27 258
原创 DAY7:leetcode #16 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact
2016-07-11 15:19:50 288
原创 DAY7:leetcode #15 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain
2016-07-11 14:00:37 384
原创 DAY7:leetcode #14 Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. Subscribe to see which companies asked this question class Solution(object): def longestCommonPrefix(
2016-07-11 09:59:15 235
空空如也
python中的xpath,为什么'/html'就匹配不到
2015-10-11
TA创建的收藏夹 TA关注的收藏夹
TA关注的人