C++
_menglan_Zi
水水一枚
展开
-
Compare Version Numbers
原题链接题目Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty an原创 2015-10-06 09:32:25 · 477 阅读 · 0 评论 -
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}, reorder it to {1,4,原创 2015-11-05 23:39:58 · 554 阅读 · 0 评论 -
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 tree, 1原创 2015-10-06 18:32:22 · 490 阅读 · 0 评论 -
Range Sum Query - Immutable
题目链接原题Given an integer array nums, find the sum of theelements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0原创 2015-11-12 12:03:43 · 639 阅读 · 0 评论 -
Range Sum Query 2D - Immutable
题目链接原题Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by (row1, col1), (row2, col2).Example:Given matrix = [ [3, 0, 1, 4, 2], [5, 6, 3, 2, 1], [1, 2, 0, 1, 5原创 2015-11-12 12:00:11 · 765 阅读 · 0 评论 -
H-Index和H-Index II
H-Index原题Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.According to the definition of h-index on Wikipedia:原创 2015-11-14 09:47:54 · 1736 阅读 · 0 评论 -
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 example:Given nums =原创 2015-10-28 20:51:40 · 434 阅读 · 0 评论 -
Insert Interval
原题题目Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Exa原创 2015-10-29 13:58:41 · 473 阅读 · 0 评论 -
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].思路先排序后mergecode/** * Definition for an interval. * stru原创 2015-10-29 14:05:27 · 407 阅读 · 0 评论 -
Merge Two Sorted Lists
题目原题Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思路类似于有序数组的归并排序.这里需要注意的是如何设置head, 和如何交换l1, l2.code/**原创 2015-10-29 14:10:22 · 538 阅读 · 0 评论 -
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原创 2015-10-30 00:31:47 · 381 阅读 · 0 评论 -
House Robber II
题目原题After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged i原创 2015-10-30 00:41:08 · 471 阅读 · 0 评论 -
Reverse Linked List
[题目](Reverse Linked List)原题Reverse a singly linked list.思路递归或者非递归.需要注意的是反转后最后节点的next指向(NULL).code/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next;原创 2015-10-29 23:03:59 · 408 阅读 · 0 评论 -
Different Ways to Add Parentheses
题目链接原题Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.思路左右子串分别计算原创 2015-11-05 23:52:24 · 550 阅读 · 0 评论 -
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.思路对搜索二叉树(BST)进行中序遍历, 得到便是有序的序列.既原创 2015-10-06 10:55:23 · 527 阅读 · 0 评论 -
J. Walk This Way
J. Walk This Way最短路径题目Description Rocking is a fat boy, and he does not like walking at all. Whenever he goes somewhere, he always tries to find a bus to take. But he lives in a ci原创 2014-11-29 17:14:34 · 695 阅读 · 0 评论 -
Largest Number
Largest Numberleetcode sort原题链接 参考 - Cindy_niu题意Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5,原创 2015-01-29 10:18:36 · 657 阅读 · 0 评论 -
Pascal's Triangle II
Pascal's Triangle IIleetcode原题链接题意Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1].Note:Could you opt原创 2015-01-29 11:18:07 · 589 阅读 · 0 评论 -
Pascal's Triangle
Pascal's Triangleleetcode原题链接题意Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1]原创 2015-01-29 10:48:27 · 573 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
Binary Tree Level Order Traversal IIleetcode dfs bfs原题链接题意Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level b原创 2015-01-29 11:36:03 · 552 阅读 · 0 评论 -
Majority Element
Majority Elementleetcode bit-opearaion map sort majority原题链接题意Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊原创 2015-01-30 18:50:16 · 684 阅读 · 0 评论 -
Find Median from Data Stream
题目链接原题Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,3,4] , the media原创 2015-11-04 09:49:33 · 423 阅读 · 0 评论 -
Remove Linked List Elements
原题链接题目Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5思路先处理链表为空/只有一个元素的情况, 其余的情况直接遍原创 2015-10-05 12:17:40 · 450 阅读 · 0 评论 -
Count Complete Tree Nodes
原题链接题意Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled原创 2015-10-04 12:39:20 · 454 阅读 · 0 评论 -
Count and Say
原题链接题目The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2原创 2015-10-06 09:57:15 · 461 阅读 · 0 评论