摘要:
https://leetcode.com/problems/implement-strstr/#/description Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -
阅读全文
posted @ 2017-06-07 18:00
Premiumlab
阅读(93)
推荐(0)
摘要:
https://leetcode.com/problems/merge-sorted-array/#/description Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted a
阅读全文
posted @ 2017-06-07 16:44
Premiumlab
阅读(125)
推荐(0)
摘要:
https://leetcode.com/problems/palindrome-linked-list/#/description Given a singly linked list, determine if it is a palindrome. Follow up:Could you do
阅读全文
posted @ 2017-06-07 15:30
Premiumlab
阅读(170)
推荐(0)
摘要:
https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2
阅读全文
posted @ 2017-06-06 21:35
Premiumlab
阅读(325)
推荐(0)
摘要:
https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2
阅读全文
posted @ 2017-06-06 21:32
Premiumlab
阅读(132)
推荐(0)
摘要:
https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2
阅读全文
posted @ 2017-06-06 21:29
Premiumlab
阅读(238)
推荐(0)
摘要:
On-Site Question 1 - SOLUTION Problem Given a list of integers and a target number, write a function that returns a boolean indicating if its possible
阅读全文
posted @ 2017-06-06 21:24
Premiumlab
阅读(130)
推荐(0)
摘要:
https://leetcode.com/problems/roman-to-integer/#/description Given a roman numeral, convert it to an integer. Input is guaranteed to be within the ran
阅读全文
posted @ 2017-06-06 21:18
Premiumlab
阅读(101)
推荐(0)
摘要:
https://leetcode.com/problems/count-and-say/#/description The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211,
阅读全文
posted @ 2017-06-06 20:18
Premiumlab
阅读(118)
推荐(0)
摘要:
https://leetcode.com/problems/diameter-of-binary-tree/#/description Given a binary tree, you need to compute the length of the diameter of the tree. T
阅读全文
posted @ 2017-06-06 15:30
Premiumlab
阅读(140)
推荐(0)