Leetcode
xinyuehuixin
这个作者很懒,什么都没留下…
展开
-
[Leetcode] 435. Non-overlapping Intervals
题目: leetcode链接 Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note: * You may assume the interval’s end p原创 2017-01-12 15:21:42 · 352 阅读 · 0 评论 -
[Leetcode]382. Linked List Random Node
题目:[leetcode]Given a singly linked list, return a random node’s value from the linked list. Each node must have the same probability of being chosen.Follow up: What if the linked list is extremely lar原创 2016-12-29 15:13:39 · 260 阅读 · 0 评论 -
[Leetcode] 436. Find Right Interval
leetcode题目 题意:给定一组区间,求给定区间 在这些区间中 在给定区间右侧,且与给定区间距离最近区间的位置。思路: 把给定区间的右边界与这些区间中的左边界进行比较,选择出,左边界比给定区间右边界大,且距给定区间最近区间。获取该区间的位置。具体代码实现: 利用java TreeMap的性质,把所有区间的左边界作为key值,所在位置作为value值,保存在map中,利用TreeMap中已原创 2016-12-07 14:19:46 · 682 阅读 · 0 评论 -
[leetcode] 121. Best Time to Buy and Sell Stock
题目: Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2016-08-26 16:50:39 · 434 阅读 · 0 评论 -
[leetcode] 122. Best Time to Buy and Sell Stock II
题目: Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2016-08-26 16:20:47 · 397 阅读 · 0 评论 -
[leetcode] 62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bo原创 2016-08-30 18:38:23 · 255 阅读 · 0 评论 -
[leetcode] 回溯法 Combination Sum 系列问题
题目: Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited number原创 2016-08-30 14:51:16 · 414 阅读 · 0 评论 -
[leetcode] 377.Combination Sum IV
Example:nums = [1, 2, 3] target = 4The possible combination ways are: (1, 1, 1, 1) (1, 1, 2) (1, 2, 1) (1, 3) (2, 1, 1) (2, 2) (3, 1)Note that different sequences are counted as different combi原创 2016-08-30 11:29:40 · 1197 阅读 · 2 评论 -
[Leetcode] 273. Integer to English Words
题目: Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example, 123 -> “One Hundred Twenty Three” 12345 -> “Twelve Thousand原创 2016-06-22 09:39:13 · 230 阅读 · 0 评论 -
[leetcode] 101. Symmetric Tree
题目: leetcode 链接思路:分别判断对称位置的值是否相同,即根节点的左子树的左节点和右子树的右节点 与 左子树的右节点和右子树的左节点是否都相同。并依次按左子树的左节点和右子树的右节点 左子树的右节点和右子树的左节点深入比较下去。递归代码:/** * Definition for a binary tree node. * public class TreeNode { *原创 2016-07-18 10:56:34 · 217 阅读 · 0 评论 -
[leetcode] 107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Given binary tree [3,9,20,null,null,15,7],原创 2016-07-18 10:12:01 · 234 阅读 · 0 评论 -
[leetcode] 198. House Robber
题目: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent h原创 2016-07-18 08:33:28 · 254 阅读 · 0 评论 -
[Leetcode] 49. Group Anagrams
题目: 链接 Group Anagrams Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return:[ [“ate”, “eat”,”tea”], [“nat”,”tan”], [“bat”原创 2016-06-15 10:04:13 · 242 阅读 · 0 评论 -
[Leetcode]357. Count Numbers with Unique Digits
题目:题意: 给出n,求出在0到 10 ^ n 次方之间的各位各不相同的数。思路: 相当于求n+1位,每位各不相同的数的个数。 当n = 1时,这一位有10 中选择 当n = 2时,第一位有9种选择(不能选择0),此时第二位也有9种选择。所以当数为两位数时有9 * 9种可能,但是因为数是在[0,100)之间,所以要加上当数只有一位数字的情况,即9 * 9 + 10; 当n = 3时,第一位9种原创 2016-12-29 15:17:58 · 238 阅读 · 0 评论 -
[Leetcode]199. Binary Tree Right Side View
题目:]题意: 给出一个二叉树,得到从右边看能看到的节点思路: 对二叉树进行层次遍历,保留每层的最后一个元素我的具体做法:是用两个队列分别保存隔层元素,当一个节点出队后队为空,则表示为该层的最后一个节点具体代码实现:/* * Definition for a binary tree node. * public class TreeNode { * int val; * Tr原创 2016-12-29 15:19:43 · 189 阅读 · 0 评论 -
[Leetcode] 108. Convert Sorted Array to balanced Binary Search Tree
题目: leetcode链接 Given an array where elements are sorted in ascending order, convert it to a height balanced BST.题意: 给定一个升序的数组,将其转化成平衡二叉搜索树。具体代码:/** * Definition for a binary tree node. * public clas原创 2017-01-12 15:20:13 · 241 阅读 · 0 评论 -
[Leetcode] 452. Minimum Number of Arrows to Burst Balloons
题目:leetcode链接 There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizon原创 2017-01-12 15:17:48 · 209 阅读 · 0 评论 -
[Leetcode] 406. Queue Reconstruction by Height
题目: leetcode链接Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in原创 2017-01-12 15:16:18 · 226 阅读 · 0 评论 -
[Leetcode] 453 Minimum Moves to Equal Array Elements
题目: leetcode链接 Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1. example: Input原创 2017-01-12 15:13:35 · 235 阅读 · 0 评论 -
[Leetcode] 413. Arithmetic Slices
题目:leetcode链接题意:求一串数字中有3个及以上连续数字组成的等差数列的个数。 例子: [1,2,3,4] 组成的有3个分别是[1,2,3],[2,3,4],[1,2,3,4];解题思路: 求出该数组中能有超过连续3个数组成等差数列的个数,然后再把每个等差数列进行拆分,求最终的个数。具体代码实现:public class Solution { public int number原创 2017-01-12 15:11:47 · 256 阅读 · 0 评论 -
[Leetcode] 378 Kth Smallest Element in a Sorted Matrix
题意: 在一个二维数组中按行有序,按列也有序,在这个二维数组中找第k大的数 思路: 使用最小堆的思想。在最小堆中找到第k个数 实现方法: 利用java中自带的优先队列实现最小堆的思想 具体代码实现: public class Solution { public int kthSmallest(int[][] matrix, int k) { int result = 0原创 2017-01-12 15:10:55 · 199 阅读 · 0 评论 -
[Leetcode] 230. Kth Smallest Element in a BST
题目: 题意: 给定一个二叉搜索树,求树中最小的第K个元素 思路: 对树进行中序遍历得到是会是有序的从小到大的结果,直接取中序遍历结果的第k元素就是结果具体代码:/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * Tre原创 2017-01-12 15:09:44 · 188 阅读 · 0 评论 -
[Leetcode]113. Path Sum II 求路径和一个数的所有路径
[题目:][9]题意:给定一个二叉树,和一个整数,求二叉树中所有从根节点到叶子节点的路径和等于这个整数的路径。代码实现:/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * Tree原创 2017-01-12 15:08:36 · 457 阅读 · 0 评论 -
[Leetcode]404. Sum of Left Leaves
题目:题意: 求二叉树中所有结点的左叶子结点之和具体代码:/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * }原创 2017-01-12 15:07:39 · 205 阅读 · 0 评论 -
[leetcode] 300. Longest Increasing Subsequence
题目:leetcode 300题链接 Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3原创 2017-01-12 15:03:31 · 236 阅读 · 0 评论 -
[Leetcode]394. Decode String
题目:[leetcode 394 链接]题意: 解码k[encoded_string] 例如2[a] 解码后结果为aa 2[a2[b]]解码结果是abbabb思路: 从内层括号向外层括号解码我的实现思路, 1) 先找到最后一个[的位置,然后找到离其最近的]然后确定[前面的数字,把[]之间的字符串重复,然后将重复的字符串把从数字开始到]位置之间的字符全部替换成转化后的结果。 然后重复1)步骤原创 2016-12-29 15:21:10 · 252 阅读 · 0 评论 -
[Leetcode]384. Shuffle an Array
384. Shuffle an Array题目[leetcode链接] Shuffle a set of numbers without duplicates.Example:// Init an array with set 1, 2, and 3. int[] nums = {1,2,3}; Solution solution = new Solution(nums);// Shuffle原创 2016-12-29 15:16:36 · 277 阅读 · 0 评论 -
[Leetcode] 350. Intersection of Two Arrays II
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note:Each element in the result should appear as many times as原创 2016-06-15 09:03:16 · 208 阅读 · 0 评论 -
[leetcode] 96. Unique Binary Search Trees
题目: Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s.思路: 当n = 1 时 BST的个数是1; 当n = 2 时 BST的个数是2;原创 2016-07-22 17:18:04 · 187 阅读 · 0 评论 -
[leetcode] 376. Wiggle Subsequence
题目:A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either p原创 2016-07-22 15:57:54 · 546 阅读 · 0 评论 -
Leetcode 2. Add Two Numbers
题目: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a原创 2016-05-04 15:04:18 · 234 阅读 · 0 评论 -
Leetcode 328. Odd Even Linked List
题目: Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in原创 2016-05-04 11:07:23 · 237 阅读 · 0 评论 -
Leetcode 141 Linked List Cycle
题目: Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space? 思路: 1)将遍历过的结点都指向头结点,遍历一个结点之前判断该结点的next的next的结点是否是头结点,如果是头结点的话,则存在环 2)设置两个指针,步数不同 如原创 2016-05-04 10:42:04 · 236 阅读 · 0 评论 -
[Leetcode] 292. Nim Game
题目: You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will b原创 2016-05-14 09:50:58 · 305 阅读 · 0 评论 -
[Leetcode] 278. First Bad Version
题目: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based o原创 2016-05-13 20:32:05 · 223 阅读 · 0 评论 -
[Leetcode] 13. Roman to Integer
题目: Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.思路: 根据规则1,2,3具体代码如下:public class Solution { public int romanToInt(String s) {原创 2016-05-13 14:20:07 · 199 阅读 · 0 评论 -
[Leetcode] 12. Integer to Roman
题目: Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.public class Solution { public String intToRoman(int num) { String M[] = {"",原创 2016-05-13 11:23:02 · 177 阅读 · 0 评论 -
[Leetcode] 318. Maximum Product of Word Lengths
题目: Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case原创 2016-05-13 11:17:09 · 249 阅读 · 0 评论 -
[Leetcode] 268. Missing Number
题目: Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.For example, Given nums = [0, 1, 3] return 2.Note: Your algorithm should run in原创 2016-05-13 09:44:38 · 311 阅读 · 0 评论 -
Leetcode 283. Move Zeroes
题目: Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your原创 2016-04-27 14:28:59 · 203 阅读 · 0 评论