- 博客(15)
- 收藏
- 关注
RSS订阅原创 【leetcode】312. Burst Balloons
312. Burst Balloonshttps://leetcode.com/problems/burst-balloons/#/description Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are a
2017-03-29 18:07:18
371
1
原创 【leetcode】53. Maximum Subarray
53. Maximum Subarrayhttps://leetcode.com/problems/maximum-subarray/#/description Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For exam
2017-03-27 19:56:46
213
原创 【leetcode】343. Integer Break
343. Integer Breakhttps://leetcode.com/problems/integer-break/#/description Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integ
2017-03-27 17:48:13
306
原创 【leetcode】13. Roman to Integer
13. Roman to Integerhttps://leetcode.com/problems/roman-to-integer/#/description Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 思路首先罗
2017-03-16 14:57:41
271
原创 【leetcode】383. Ransom Note
383. Ransom Notehttps://leetcode.com/problems/ransom-note/#/description Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will
2017-03-16 13:46:00
278
原创 【leetcode】532. K-diff Pairs in an Array
532. K-diff Pairs in an Arrayhttps://leetcode.com/problems/k-diff-pairs-in-an-array/#/description Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in th
2017-03-14 16:32:27
794
原创 【leetcode】380. Insert Delete GetRandom O(1)
380. Insert Delete GetRandom O(1)https://leetcode.com/problems/insert-delete-getrandom-o1/?tab=Description Design a data structure that supports all following operations in average O(1) time. in
2017-03-10 14:06:16
298
原创 面试遇到的问题(不断更新)
第一题 把一个数组分成四份，三个分割点不算进求和中，使得每份的和要相同。如果可以返回true,如果不能分为四份和一样的就返回false。 {2，5，1，1，1，1，4，3，7，5，7} 比如这数组，分为四份，每份的和相同，分割点不算，分为{2，5} {1，1，1，4}，{7}，{7}.。设计的函数时间复杂度不超过O（n） 解法一没见过题目，如果都是正整数的话，是不是可以这么来。用一个map
2017-03-06 21:29:41
297
原创 【leetcode】92. Reverse Linked List II
92. Reverse Linked List IIhttps://leetcode.com/problems/reverse-linked-list-ii/?tab=Description Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given
2017-03-06 11:10:45
218
原创 【leetcode】203. Remove Linked List Elements
203. Remove Linked List Elementshttps://leetcode.com/problems/remove-linked-list-elements/?tab=Description Remove all elements from a linked list of integers that have value val. Example Give
2017-03-06 10:35:28
213
转载 【leetcode】312. Burst Balloons
312. Burst Balloonshttps://leetcode.com/problems/burst-balloons/?tab=Description Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You ar
2017-03-02 22:11:50
322
转载 【leetcode】312. Burst Balloons
312. Burst Balloonshttps://leetcode.com/problems/burst-balloons/?tab=Description Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You ar
2017-03-02 22:11:09
283
原创 【leetcode】328. Odd Even Linked List
328. Odd Even Linked Listhttps://leetcode.com/problems/odd-even-linked-list/?tab=Description 链表是弱项，要多训练。 Given a singly linked list, group all odd nodes together followed by the even nodes. Please n
2017-03-02 19:47:51
282
原创 【leetcode】94. Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversalhttps://leetcode.com/problems/binary-tree-inorder-traversal/?tab=Description Given a binary tree, return the inorder traversal of its nodes’ values. For example:
2017-03-02 15:44:32
350
原创 【leetcode】347. Top K Frequent Elements
347. Top K Frequent Elementshttps://leetcode.com/problems/top-k-frequent-elements/?tab=Description Given a non-empty array of integers, return the k most frequent elements. For example, Given
2017-03-02 13:13:04
233
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人