摘要：
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list t 阅读全文
posted @ 2018-10-09 08:35
Veritas_des_Liberty
阅读(167)
评论(0)
推荐(0)
摘要：
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividi 阅读全文
posted @ 2018-10-08 21:57
Veritas_des_Liberty
阅读(190)
评论(0)
推荐(0)
摘要：
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to 阅读全文
posted @ 2018-10-07 22:39
Veritas_des_Liberty
阅读(207)
评论(0)
推荐(0)
摘要：
origianl For the past few days, I’ve been reading various explanations of the Knuth-Morris-Pratt string searching algorithms. For some reason, none of 阅读全文
posted @ 2018-10-06 22:03
Veritas_des_Liberty
阅读(315)
评论(0)
推荐(0)
摘要：
Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1: Example 2: Cla 阅读全文
posted @ 2018-10-06 21:38
Veritas_des_Liberty
阅读(183)
评论(0)
推荐(0)
摘要：
Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra space for another ar 阅读全文
posted @ 2018-10-06 21:17
Veritas_des_Liberty
阅读(211)
评论(0)
推荐(0)
摘要：
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra spa 阅读全文
posted @ 2018-10-06 21:12
Veritas_des_Liberty
阅读(188)
评论(0)
推荐(0)
摘要：
Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no 阅读全文
posted @ 2018-10-05 21:52
Veritas_des_Liberty
阅读(182)
评论(0)
推荐(0)
摘要：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: AC code: Runtime: 56 ms, faster than 26.25 阅读全文
posted @ 2018-10-05 21:07
Veritas_des_Liberty
阅读(124)
评论(0)
推荐(0)
摘要：
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: A 阅读全文
posted @ 2018-10-04 10:43
Veritas_des_Liberty
阅读(193)
评论(0)
推荐(0)
浙公网安备 33010602011771号