【LeetCode】
文章平均质量分 56
我在天上飘
自信的生活态度最重要!
展开
-
【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 on the原创 2016-03-15 23:04:46 · 170 阅读 · 0 评论 -
【LeetCode】69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.class Solution {public: int mySqrt(int x) { if(x<=1) return x; long low = 1; long high = x;原创 2016-03-16 08:39:16 · 181 阅读 · 0 评论 -
【LeetCode】
Implement pow(x, n).class Solution {public: double myPow(double x, int n) { return myPow1(x,n); } double myPow1(double x, long long n) { if(n == 0)return 1转载 2016-03-16 09:30:48 · 175 阅读 · 0 评论 -
【LeetCode】153. 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 duplicate exists in原创 2016-03-16 09:48:06 · 195 阅读 · 0 评论 -
【LeetCode】35. 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.原创 2016-03-16 10:14:40 · 201 阅读 · 0 评论 -
【LeetCode】55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i原创 2016-03-16 13:37:40 · 200 阅读 · 0 评论 -
【LeetCode】88. Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold addit原创 2016-03-16 22:08:36 · 190 阅读 · 0 评论 -
【LeetCode】20. Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2016-03-17 09:07:45 · 182 阅读 · 0 评论 -
【LeetCode】331. Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #.转载 2016-03-17 10:36:09 · 986 阅读 · 1 评论 -
【LeetCode】94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]./** * Definition for a转载 2016-03-17 11:16:03 · 205 阅读 · 0 评论 -
【LeetCode】144. Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].【思路】1)如果根节点非空,将根节点原创 2016-03-17 15:04:53 · 193 阅读 · 0 评论 -
【LeetCode】58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-03-30 18:58:06 · 182 阅读 · 0 评论 -
【LeetCode】257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]/** * De转载 2016-03-30 20:45:10 · 222 阅读 · 0 评论 -
【LeetCode】100. 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 identical and the nodes have the same value.递归调用:/原创 2016-03-08 11:22:45 · 250 阅读 · 0 评论 -
【LeetCode】111. 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 root node down to the nearest leaf node.【思路】递归调用,注意判断树的深度应该到叶子节点,也就是左右原创 2016-03-08 12:37:32 · 192 阅读 · 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 you原创 2016-03-08 10:59:34 · 183 阅读 · 0 评论 -
【LeetCode】203. 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在链表中移除目标值。 也是维护一个dummy n原创 2016-03-08 10:04:19 · 189 阅读 · 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 link原创 2016-03-08 15:13:12 · 189 阅读 · 0 评论 -
【LeetCode】67. Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".【思路一】从最后一位开始相加,设置进位标志量,最后反转字符串得到和。class Solution {public: string addBin原创 2016-03-08 17:22:18 · 156 阅读 · 0 评论 -
【LeetCode】242. Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.[思路]用sorth函数将两字符串排原创 2016-03-08 19:05:00 · 227 阅读 · 0 评论 -
【LeetCode】171. Excel Sheet Column Number && 168. Excel Sheet Column Title
171.Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 class So原创 2016-03-08 19:38:27 · 183 阅读 · 0 评论 -
【LeetCode】217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2016-03-08 19:49:11 · 184 阅读 · 0 评论 -
【LeetCode】219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and jis at most k.【原创 2016-03-08 20:36:41 · 176 阅读 · 0 评论 -
【LeetCode】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 majority element原创 2016-03-08 21:01:26 · 182 阅读 · 0 评论 -
【LeetCode】206. Reverse Linked List
Reverse a singly linked list.遍历该单链表,将节点一个一个摘下来,采用 头插法 插入另一条链表/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x)原创 2016-03-08 22:08:12 · 188 阅读 · 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-03-09 11:25:18 · 207 阅读 · 0 评论 -
【LeetCode】234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?【思路一】将list反转到新list,后一一进行比较。/** * Definition for singly-linked list. *原创 2016-03-09 12:45:32 · 209 阅读 · 0 评论 -
【LeetCode】125. Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a原创 2016-03-09 13:59:58 · 188 阅读 · 0 评论 -
【LeetCode】70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?【思路】斐波那契数列,第n阶是由第n-1阶和n-2阶的方原创 2016-03-09 14:53:39 · 171 阅读 · 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原创 2016-03-09 15:08:15 · 175 阅读 · 0 评论 -
【LeetCode】13. Roman to Integer && 12. Integer to Roman
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999./*1~9: {"I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};10~90: {"X", "XX",原创 2016-03-09 09:56:01 · 219 阅读 · 0 评论 -
【LeetCode】235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betwee原创 2016-03-09 10:37:18 · 184 阅读 · 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 house原创 2016-03-10 22:42:53 · 185 阅读 · 0 评论 -
【LeetCode】26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-03-11 08:42:46 · 198 阅读 · 0 评论 -
【LeetCode】152. Maximum Product Subarray && 53. Maximum 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 the largest原创 2016-03-11 09:54:58 · 199 阅读 · 0 评论 -
【LeetCode】121. Best Time to Buy and Sell Stock && 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.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2016-03-11 10:18:23 · 183 阅读 · 0 评论 -
【LeetCode】21. 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./** * Definition for singly-linked list. * struct Lis原创 2016-03-11 11:40:12 · 215 阅读 · 0 评论 -
【LeetCode】66. 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.class Solution {pub原创 2016-03-12 21:38:47 · 170 阅读 · 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,#,#,15,7},原创 2016-03-13 21:12:41 · 185 阅读 · 0 评论 -
【LeetCode】118. Pascal's Triangle
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], [1,4,6,4,1]]class Solution {public:原创 2016-03-13 21:47:00 · 168 阅读 · 0 评论