LeetCode
文章平均质量分 68
vanish_dust
永远不要低估坚持的力量!
展开
-
LeetCode-Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.class Solution {public: int romanToInt(string s) { int num= s.siz原创 2014-12-16 21:58:34 · 358 阅读 · 0 评论 -
LeetCode-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 down or right at原创 2015-01-14 23:14:37 · 377 阅读 · 0 评论 -
LeetCode-Pow(x, n)
Implement pow(x, n).double searcht(double x,int m);double output = 1;class Solution {public: double pow(double x, int n);};//不知道采用迭代算法怎么样double Solution::pow(double x, int n){ int signa原创 2014-12-25 20:05:13 · 432 阅读 · 0 评论 -
LeetCode-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原创 2015-01-15 21:27:46 · 561 阅读 · 0 评论 -
LeetCode-Binary Tree Postorder Traversal
题目链接:https://oj.leetcode.com/problems/binary-tree-postorder-traversal/题目:Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},原创 2015-02-02 18:25:02 · 536 阅读 · 0 评论 -
LeetCode-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 respectively in the原创 2015-01-15 21:30:40 · 533 阅读 · 0 评论 -
LeetCode-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原创 2014-12-28 00:35:09 · 335 阅读 · 0 评论 -
LeetCode-Minimum Depth of Binary Tree
题目链接:https://oj.leetcode.com/problems/minimum-depth-of-binary-tree/题目:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the ro原创 2015-02-05 17:05:48 · 535 阅读 · 0 评论 -
LeetCode-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原创 2015-01-20 21:53:56 · 748 阅读 · 0 评论 -
LeetCode-Spiral Matrix
题目链接:https://oj.leetcode.com/problems/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 follo原创 2015-01-21 22:59:08 · 535 阅读 · 0 评论 -
LeetCode-Set Matrix Zeroes
题目链接:https://oj.leetcode.com/problems/set-matrix-zeroes/题目内容:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow u原创 2015-01-21 22:52:30 · 481 阅读 · 0 评论 -
Leetcode-Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.解题报告:非常简单的题,相当于进行进位加原创 2015-01-04 22:29:15 · 383 阅读 · 0 评论 -
LeetCode-Remove Nth Node From End of List
题目链接:https://leetcode.com/problems/remove-nth-node-from-end-of-list/题目:Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1原创 2015-03-09 08:52:14 · 578 阅读 · 0 评论 -
LeetCode_Merge Two Sorted Lists
题目链接:https://leetcode.com/problems/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原创 2015-03-09 08:58:57 · 517 阅读 · 0 评论 -
LeetCode_Intersection of Two Linked Lists
题目链接:https://leetcode.com/problems/intersection-of-two-linked-lists/题目:Write a program to find the node at which the intersection of two singly linked lists begins.For example, the followi原创 2015-03-09 09:11:54 · 629 阅读 · 0 评论 -
Leetcode-Binary Tree Preorder Traversal
题目链接:https://oj.leetcode.com/problems/binary-tree-preorder-traversal/题目:Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},原创 2015-02-02 18:18:05 · 499 阅读 · 0 评论 -
LeetCode-Integer to Roman
class Solution {public: string intToRoman(int num);};string Solution::intToRoman(int num){ string s=""; while(num >= 1000) { num -= 1000; s = s + 'M'; } while(num >= 900) {原创 2014-12-23 23:21:09 · 404 阅读 · 0 评论 -
LeetCode-Binary Tree Inorder Traversal
题目链接:https://oj.leetcode.com/problems/binary-tree-inorder-traversal/题目:Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},原创 2015-02-02 18:22:05 · 450 阅读 · 0 评论 -
LeetCode-Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro原创 2015-01-07 23:32:45 · 453 阅读 · 0 评论 -
LeetCode-Sort Colors
题目链接:https://oj.leetcode.com/problems/sort-colors/题目信息:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the原创 2015-01-28 23:03:09 · 492 阅读 · 0 评论 -
LeetCode-Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target valueYour algorithm's runtime complexity must be in the order of O(log n).If the target is not found i原创 2015-01-08 21:57:49 · 588 阅读 · 0 评论 -
LeetCode-Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2015-01-09 21:03:31 · 447 阅读 · 0 评论 -
LeetCode-Sort Colors
题目链接:https://oj.leetcode.com/problems/sort-colors/题目:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the or原创 2015-01-29 23:20:51 · 479 阅读 · 0 评论 -
LeetCode-Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in原创 2015-01-10 21:00:54 · 408 阅读 · 0 评论 -
LeetCode-Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.原创 2015-01-10 21:43:37 · 383 阅读 · 0 评论 -
LeetCode-Compare Version Numbers
Compare two version numbers version1 and version1.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2015-01-11 23:20:24 · 413 阅读 · 0 评论 -
LeetCode-Sqrt(x)
Compute and return the square root of x.class Solution {public: int sqrt(int x) ;};int Solution::sqrt(int x){ int i,j; int output=x; int value=x; i=0; j=x; if(x==0) return 0; whil原创 2014-12-22 23:27:07 · 367 阅读 · 0 评论 -
LeetCode-Same Treet
题目链接:https://oj.leetcode.com/problems/same-tree/题目:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally i原创 2015-01-29 23:23:05 · 546 阅读 · 0 评论 -
LeetCode-Binary Tree Level Order Traversal
题目链接:https://oj.leetcode.com/problems/binary-tree-level-order-traversal/题目:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).原创 2015-01-31 23:18:39 · 531 阅读 · 0 评论 -
LeetCode-Binary Tree Level Order Traversal II
题目链接:https://oj.leetcode.com/problems/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, l原创 2015-01-31 23:29:01 · 475 阅读 · 0 评论 -
LeetCode-Balanced Binary Tree
题目链接:https://oj.leetcode.com/problems/balanced-binary-tree/题目:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary t原创 2015-01-31 23:03:06 · 494 阅读 · 0 评论 -
LeetCode-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 [4,−1,2,1] ha原创 2015-01-13 19:31:33 · 443 阅读 · 0 评论 -
LeetCode-Symmetric Tree
题目链接:https://oj.leetcode.com/problems/symmetric-tree/题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is s原创 2015-01-31 23:12:44 · 583 阅读 · 0 评论 -
LeetCode-Repeated DNA Sequences
题目链接:https://leetcode.com/problems/repeated-dna-sequences/All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is someti原创 2015-04-26 20:37:31 · 478 阅读 · 0 评论