leetcode
文章平均质量分 71
清空的代码
这个作者很懒,什么都没留下…
展开
-
[leetcode 172] Factorial Trailing Zeroes
Question:Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.要求输入为n,求n!中尾数0的个数。要求时间复杂度为O(log(n));分析:暴力法可以是先求出n原创 2015-11-03 22:32:07 · 354 阅读 · 0 评论 -
[leetcode 119] Pascal's Triangle II
Question: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 optimize your algorithm to use only O(k) extra space?原创 2015-11-04 21:41:02 · 304 阅读 · 0 评论 -
[leetcode 102] Binary Tree Level Order Traversal
Question:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \原创 2015-11-04 20:32:05 · 317 阅读 · 0 评论 -
[LeetCode 266]Palindrome Permutation
回文序列(回文结构) 如果一个序列的逆序列与原序列相同,则这个序列为回文序列或有回文结构。比如“1235321”。如何判断回文结构:最多只有一个字符的个数为奇数个,其余均为偶数个。leetcode上有个相关题目:Problem Description:Given a string, determine if a permutation原创 2015-10-20 21:58:54 · 1025 阅读 · 0 评论 -
[leetcode 160]Intersection of Two Linked Lists
Question:Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘原创 2015-11-04 23:19:28 · 329 阅读 · 0 评论 -
[leetcode 112]Path Sum
Question:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binar原创 2015-11-04 22:05:00 · 423 阅读 · 0 评论 -
[leetcode 111]Minimum Depth of Binary Tree
Question: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.分析:1、root = NULL,深度原创 2015-11-05 21:54:53 · 436 阅读 · 0 评论 -
[leetcode 9] Palindrome Number
Question:Determine whether an integer is a palindrome.Do this without extra space.分析:回文数字,将数字倒过来和原来数字一样。比如101,5,12321等。注意与266题的区别。只要将原来数字的逆序数字求出来即可。代码:class Solution {public:原创 2015-11-04 22:48:02 · 320 阅读 · 0 评论 -
[leetcode 190] Reverse Bits
Question:Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in bina原创 2015-11-07 15:46:58 · 362 阅读 · 0 评论 -
[leetcode 157] Read N Characters Given Read4
Question:The API: int read4(char *buf) reads 4 characters at a time from a file.The return value is the actual number of characters read. For example, it returns 3 if there is only 3 charact原创 2015-11-06 14:04:51 · 1346 阅读 · 0 评论 -
[leetcode 36] Valid Sudoku
Question:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A pa原创 2015-11-07 18:15:27 · 382 阅读 · 0 评论 -
[leetcode 88]Merge Sorted Array
Question: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原创 2015-11-06 19:58:07 · 300 阅读 · 0 评论 -
[leetcode243] Shortest Word Distance
Problem Description:Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.For example,Assume that words = ["practice", "ma原创 2015-10-22 21:53:42 · 723 阅读 · 0 评论 -
[leetcode 293] Flip Game
Problem Description:You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecut原创 2015-10-22 21:11:58 · 783 阅读 · 0 评论 -
[leetcode 252] Meeting Rooms
Problem Description:Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si For example,Given [[0, 30],[5, 10],[15, 20]],return false.原创 2015-10-27 23:07:07 · 1260 阅读 · 0 评论 -
[leetcode 219] Contains Duplicate II
Question: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 j is at most k原创 2015-11-13 23:02:41 · 339 阅读 · 0 评论 -
[leetcode 58] Length of Last Word
class Solution {private: vector split(string s, string pattern){ int pos; vector result; s += pattern; for(int i = 0; i pos = s.find(pattern,i)原创 2015-11-13 21:20:53 · 330 阅读 · 0 评论 -
[leetcode 19] Remove Nth Node From End of List
Question:Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node fr原创 2015-11-13 21:59:09 · 289 阅读 · 0 评论 -
[leetcode 107]Binary Tree Level Order Traversal II
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-11-01 18:02:32 · 378 阅读 · 0 评论 -
[leetcode 66]Pluss One
class Solution {public: vector plusOne(vector& digits) { bool isNine = true; for(int i : digits) if(i != 9) isNine = false; if(isNine){原创 2015-11-01 18:43:16 · 386 阅读 · 0 评论 -
[leetcode 249] Group Shifted Strings
Question:Given a string, we can "shift" each of its letter to its successive letter, for example:"abc" -> "bcd". We can keep "shifting" which forms the sequence:"abc" -> "bcd" -> ... -> "xyz"Giv原创 2015-11-17 09:10:21 · 2330 阅读 · 0 评论 -
[leetcode 101]Symmetric Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-11-01 17:58:46 · 323 阅读 · 0 评论 -
[leetcode 246] Strobogrammatic Number
Question:A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).Write a function to determine if a number is strobogrammatic. The number is rep原创 2015-11-01 12:06:14 · 1164 阅读 · 0 评论 -
[leetcode 27]Remove Element
class Solution {public: int removeElement(vector& nums, int val) { vector::iterator it; if(nums.size() == 0) return 0; for(it = nums.begin(); it != nums.end();原创 2015-11-01 18:00:29 · 326 阅读 · 0 评论 -
[leetcode 231]Power of Two
class Solution {public: bool isPowerOfTwo(int n) { /* if(n <= 0) return false; if(n == 1) return true; if(n%2 == 1) return false;原创 2015-11-01 17:57:32 · 328 阅读 · 0 评论 -
[leetcode 6] ZigZag Conversion
Question:The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H原创 2015-12-11 08:36:50 · 517 阅读 · 0 评论 -
[leetcode 118]Pascal's triangle
Question: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]]Solution:原创 2015-11-02 22:05:04 · 334 阅读 · 0 评论 -
[leetcode 26]Remove Duplicates from Sorted Array
class Solution {public: int removeDuplicates(vector& nums) { vector::iterator it; if(nums.empty()) return 0; for(it = nums.begin()+1; it != nums.end();)原创 2015-11-01 18:03:46 · 319 阅读 · 0 评论 -
[leetcode 110]Balanced Binary Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-11-01 17:55:52 · 386 阅读 · 0 评论 -
[leetcode 198]House Robber
Question: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 adj原创 2015-11-02 21:46:59 · 323 阅读 · 0 评论 -
[leetcode 270] Closest Binary Search Tree Value
Question:Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.Note:Given target value is a floating point.You are guaranteed t原创 2015-11-02 22:31:59 · 638 阅读 · 0 评论 -
[leetcode 225] Implement Stack using Queues
Question: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()原创 2015-11-02 23:04:52 · 358 阅读 · 0 评论 -
[leetcode 28] Implement strStr()
Question:Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.分析:字符串模式匹配问题,采用Sunday算法,详看文章sunday算法介绍;代码如下:c原创 2015-12-10 21:35:48 · 361 阅读 · 0 评论 -
[leetcode 125] Valid Palindrome
Question: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原创 2015-12-10 22:53:27 · 421 阅读 · 0 评论 -
[leetcode 223] Rectangle Area
Question:Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle原创 2015-11-19 12:33:12 · 507 阅读 · 0 评论 -
[leetcode 276] Paint Fence
Question:There is a fence with n posts, each post can be painted with one of the k colors.You have to paint all the posts such that no more than two adjacent fence posts have the same color.原创 2015-11-19 14:05:50 · 3055 阅读 · 0 评论 -
[leetcode 20] Valid Parentheses
Question:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" a原创 2015-11-19 13:06:28 · 357 阅读 · 0 评论 -
[leetcode 203] Remove Linked List Elements
Question: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-11-19 21:53:57 · 402 阅读 · 0 评论 -
[leetcode 205] Isomorphic Strings
Question:Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced wi原创 2015-11-19 23:03:35 · 427 阅读 · 0 评论 -
[leetcode 204] Count Primes
Question:Description:Count the number of prime numbers less than a non-negative number, n.分析:求解比n小的所有素数的个数;暴力法:判断比n小的数是否为素数。采用埃拉托斯特尼筛法Sieve of Eratosthenes方法,具体解析参考网上原创 2015-12-12 17:15:46 · 339 阅读 · 0 评论