Java
文章平均质量分 73
Whu_Xcy
这个作者很懒,什么都没留下…
展开
-
leetcode oj java 116. Populating Next Right Pointers in Each Node
一、问题描述:Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next原创 2017-01-21 11:03:11 · 288 阅读 · 0 评论 -
leetcode oj java 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. 1 3 3 2原创 2016-12-30 16:31:09 · 296 阅读 · 0 评论 -
leetcode oj java 108 Convert Sorted Array to Binary Search Tree
一、问题描述:Given an array where elements are sorted in ascending order, convert it to a height balanced BST.二、解决思路: 平衡BST的话,位于中间位置的节点当做ROOT, 可以保证平衡。中间节点的左边元素为左子树右边元素为右子树,递归即可。三、代码:pa原创 2016-12-30 16:09:41 · 279 阅读 · 0 评论 -
leetcode oj java 98. Validate Binary Search Tree
一、问题描述:Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the原创 2016-12-30 14:27:04 · 329 阅读 · 0 评论 -
leetcode oj java Gray Code
一、问题描述:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the原创 2016-12-20 10:31:50 · 237 阅读 · 0 评论 -
Leetcode oj java 54. Spiral Matrix
一、问题描述:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7,原创 2016-12-28 12:12:43 · 266 阅读 · 0 评论 -
leetcode oj java 59. Spiral Matrix II
一、问题描述:Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [原创 2016-12-28 11:26:51 · 250 阅读 · 0 评论 -
leetcode oj java 56. Merge Intervals
一、问题描述:Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].二、解决思路:针对间隔,按照start从小到大排序。(重写了sort方原创 2016-12-28 10:28:50 · 303 阅读 · 0 评论 -
leetcode oj java 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二、解决思路:Merge k Sorted Lis原创 2016-12-28 10:19:54 · 251 阅读 · 0 评论 -
Merge 2 Sorted Lists
合并两个有序链表:P1 1-3-5-7-9P2 2-4-6-8-10首先选取P1.head 和P2.head 中较小的作为头结点。假设是P1.那么Head的next节点应该是P1.next 和 p2 中较小的节点。即P1以P1.next 为头结点继续迭代。代码(递归)public static ListNode mergeLists(ListNode r原创 2016-12-27 22:00:03 · 251 阅读 · 0 评论 -
leetcode oj java 260. Single Number III
一、问题描述:Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For examp原创 2017-01-04 11:34:22 · 399 阅读 · 0 评论 -
Leetcode oj java 334. Increasing Triplet Subsequence
一、问题描述:Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if there exists i, j, k such t原创 2016-12-27 10:42:49 · 378 阅读 · 0 评论 -
leetcode oj java Reverse Linked List II
一、问题描述:Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m,原创 2016-12-26 22:58:41 · 215 阅读 · 0 评论 -
Leetcode oj java Delete Node in a Linked List
一、问题描述:Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third no原创 2016-12-26 20:46:10 · 275 阅读 · 0 评论 -
leetcode oj java Counting Bits
一、问题描述:Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:原创 2016-12-26 15:02:40 · 206 阅读 · 0 评论 -
leetcode oj java Find Minimum in Rotated Sorted Array
一、问题描述:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplica原创 2016-12-26 14:01:52 · 216 阅读 · 0 评论 -
leetcode oj java Implement Stack using Queues
一、问题描述:Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -原创 2016-12-25 22:41:14 · 231 阅读 · 0 评论 -
leetcode oj java Implement Queue using Stacks
一、问题描述:Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front e原创 2016-12-25 21:53:10 · 213 阅读 · 0 评论 -
leetcode oj java Number of Segments in a String
一、问题描述:Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable原创 2016-12-20 15:35:04 · 373 阅读 · 0 评论 -
leetcode oj java 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原创 2016-12-20 16:01:57 · 224 阅读 · 0 评论 -
leetcode oj java Unique Paths II
一、题目描述:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectiv原创 2016-12-20 16:21:00 · 220 阅读 · 0 评论 -
leetcode oj java 485. Max Consecutive Ones
一、问题描述:Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits a原创 2017-01-19 20:52:29 · 517 阅读 · 0 评论 -
leetcode oj java 230. Kth Smallest Element in a BST
一、问题描述:Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.二、解决思路:原创 2017-01-17 22:41:30 · 297 阅读 · 0 评论 -
leetcode oj java 476. Number Complement
一、问题描述:Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer is guaranteed to fit with原创 2017-01-11 21:58:25 · 812 阅读 · 0 评论 -
leetcode oj java 481. Magical String
一、问题描述:A magical string S consists of only '1' and '2' and obeys the following rules:The string S is magical because concatenating the number of contiguous occurrences of characters '1' and原创 2017-01-11 21:38:30 · 1060 阅读 · 0 评论 -
leetcode oj java 152. Maximum Product Subarray
一、问题描述:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has原创 2017-01-01 10:46:00 · 281 阅读 · 0 评论 -
leetcode oj java 143. Reorder List
一、问题描述:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, r原创 2017-01-15 15:25:25 · 340 阅读 · 0 评论 -
leetcode oj java 69. Sqrt(x)
一、问题描述:Implement int sqrt(int x).Compute and return the square root of x.二、解决思路看到代码中返回类型是Int, 非常开心! 二分法~~ 但是需要注意边界值 MAX_INT. 而且MAX_INT的平方我们已知是46340, 我们在初始化的时候end =(x+1)/2,如果end >原创 2017-01-14 22:33:55 · 424 阅读 · 0 评论 -
leetcode oj java 49. 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"]]原创 2017-01-14 17:27:48 · 387 阅读 · 0 评论 -
leetcode oj java 215. Kth Largest Element in an Array
一、问题描述:Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and k =原创 2017-01-14 16:10:18 · 261 阅读 · 0 评论 -
leetcode oj java 199. Binary Tree Right Side View
一、问题描述:Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary原创 2017-01-14 15:40:05 · 312 阅读 · 0 评论 -
leetcode oj java 64. Minimum Path Sum
一、问题描述:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either dow原创 2017-01-14 13:05:09 · 240 阅读 · 0 评论 -
leetcode oj java 386. Lexicographical Numbers
一、问题描述:Given an integer n, return 1 - n in lexicographical order.For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].Please optimize your algorithm to use less time and space.原创 2017-01-14 10:26:40 · 295 阅读 · 0 评论 -
leetcode oj java 309. Best Time to Buy and Sell Stock with Cooldown
一、问题描述: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 lik原创 2017-01-13 22:44:59 · 551 阅读 · 0 评论 -
leetcode oj java 337. House Robber III
一、问题描述:The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house.原创 2017-01-13 22:05:16 · 280 阅读 · 0 评论 -
leetcode oj java 475. Heaters
一、问题描述:Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.Now, you are given positions of houses and heaters on原创 2017-01-08 23:06:46 · 362 阅读 · 0 评论 -
leetcode oj java 53. Maximum Subarray
一、问题描述:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray原创 2016-12-31 16:03:47 · 281 阅读 · 0 评论 -
leetcode oj java 169. Majority Element
一、问题描述:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majo原创 2016-12-31 14:55:43 · 228 阅读 · 0 评论 -
Leetcode oj java Construct Binary Tree from Inorder and Postorder Traversal
一、问题描述:Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.二、解决思路:以下图为例:中序遍历为: 4 7 2 1 5原创 2016-12-25 16:59:11 · 310 阅读 · 0 评论 -
leetcode oj java Decode String
一、问题描述:Given an encoded string, return it's decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. N原创 2016-12-19 00:04:16 · 263 阅读 · 0 评论