LeetCode
文章平均质量分 57
「已注销」
精神病人思路广,2B青年欢乐多!
展开
-
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].Note: Recursive solution is trivial, could原创 2015-06-01 19:02:12 · 1087 阅读 · 0 评论 -
LeetCode 228: Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].代码要求对数组中的元素进行分段。首先给出字符串格式化函数,如果begin==end, 则输出字原创 2015-06-26 18:32:00 · 4180 阅读 · 6 评论 -
LeetCode 208: Implement Trie (Prefix Tree)
Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.前缀查找树,简单的可以实现为一种26叉树。需要在节点上增加一个字段,标明该节点是否是一个单词,还是仅仅是单词的前缀。代码原创 2015-06-27 15:32:38 · 3977 阅读 · 0 评论 -
LeetCode 25: Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.原创 2015-06-08 20:00:42 · 4775 阅读 · 0 评论 -
LeetCode 232: 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 element.empty(原创 2015-07-07 19:35:06 · 5166 阅读 · 0 评论 -
LeetCode 15: 3 Sum
Given an array S of n integers, are there elements a,b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c) m原创 2015-06-09 19:45:38 · 3331 阅读 · 0 评论 -
LeetCode 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 = 2, return 5.原创 2015-05-27 00:11:33 · 3750 阅读 · 0 评论 -
LeetCode 230: Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find thekth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the BST原创 2015-07-02 14:27:17 · 6865 阅读 · 3 评论 -
LeetCode 225: 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() -- Return whet原创 2015-06-13 14:58:28 · 6748 阅读 · 0 评论 -
LeetCode 119:Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].题目要求计算杨辉三角某一行的元素,这个也是二项式系数的计算问题。class Solution {public: vector getRow(int row原创 2015-06-06 01:38:13 · 2624 阅读 · 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 {publi原创 2015-06-06 01:31:49 · 1510 阅读 · 0 评论 -
LeetCode 03: Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2015-06-01 22:58:24 · 1880 阅读 · 0 评论 -
LeetCode 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].分析:题目要求对区间进行合并,首先必须对区间按照左边元素的大小进行排序,然后对排原创 2015-06-02 21:17:41 · 2893 阅读 · 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 valid b原创 2015-06-02 22:05:50 · 1604 阅读 · 0 评论 -
LeetCode 44:Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cov原创 2015-06-03 23:13:44 · 1955 阅读 · 0 评论 -
LeetCode 28:Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.实现函数strStr。代码如下:int strStr(char* haystack, char* needle) { size_原创 2015-06-03 23:08:12 · 700 阅读 · 0 评论 -
LeetCode 27:Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.题原创 2015-06-03 23:05:55 · 2604 阅读 · 0 评论 -
LeetCode 83:Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.简单链表操作,代码如下:/** *原创 2015-06-06 01:26:43 · 762 阅读 · 0 评论 -
LeetCode 86 Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of原创 2015-06-06 01:27:06 · 2391 阅读 · 0 评论 -
LeetCode 24:Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y原创 2015-06-13 23:12:02 · 1535 阅读 · 0 评论 -
LeetCode 26: Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2015-06-15 19:32:10 · 1523 阅读 · 0 评论 -
LeetCode 82: Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1->1->原创 2015-06-15 19:19:06 · 572 阅读 · 0 评论 -
LeetCode 84. Largest Rectangle in Histogram
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each bar原创 2016-10-22 17:04:00 · 446 阅读 · 0 评论 -
Leetcode 173: Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next() and hasN原创 2016-10-05 21:07:23 · 493 阅读 · 0 评论 -
LeetCode172. Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.题目中要求计算n!末尾0的个数,最笨的方法莫过于首先计算n!,然后再计算结果末尾的0,这样时明显不符合题目算法时间复杂度要求的。我们首先看N比较小的一种情原创 2016-10-05 22:38:05 · 453 阅读 · 0 评论 -
LeetCode 105:Construct Binary Tree from Preorder and Inorder Traversal
LeetCode 105:Given preorder and inorder traversal of a tree, construct the binary tree.给定一个二叉树的前序和中序遍历,重建这棵二叉树。原创 2015-05-20 23:09:41 · 1568 阅读 · 0 评论 -
LeetCode 9: Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.本题是判断一个数是否是回文数。代码如下:bool isPalindrome(int x) { int max = x; int min = 0; while(max >0){ min...原创 2015-06-01 23:11:53 · 3510 阅读 · 4 评论 -
LeetCode 6: ZigZag Conversion
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 N A P L S I I G原创 2016-10-07 03:53:58 · 1487 阅读 · 0 评论 -
[LeetCode] 151Reverse Words in a String C语言版
Given an input string, reverse the string word by word.Example: Input: “the sky is blue”, Output: “blue is sky the”. Note:A word is defined as a sequence of non-space characters. Input strin...原创 2018-08-29 22:54:27 · 497 阅读 · 0 评论 -
[Leetcode] 557. Reverse Words in a String III
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1: Input: “Let’s take LeetCode contest” ...原创 2018-08-29 22:58:01 · 242 阅读 · 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.原创 2015-06-15 19:57:29 · 589 阅读 · 0 评论 -
LeetCode 238: Product of Array Except Self
Given an array of n integers where n > 1, nums, return an arrayoutput such that output[i] is equal to the product of all the elements ofnums except nums[i].Solve it without division and in O(n).原创 2015-07-27 18:51:41 · 4104 阅读 · 3 评论 -
Leetcode 226: Invert Binary Tree(二叉树反转 递归、非递归实现)
nvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howel原创 2015-06-13 14:41:43 · 20181 阅读 · 0 评论 -
LeetCode 80:Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five e原创 2015-06-15 19:49:29 · 624 阅读 · 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原创 2015-07-27 18:41:00 · 2675 阅读 · 0 评论 -
LeetCode 237 : 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 node with value原创 2015-07-27 13:54:09 · 6830 阅读 · 2 评论 -
LeetCode 231: Power of Two
Given an integer, write a function to determine if it is a power of two.判断一个数是否是2的幂,判断方法主要依据2的N次幂的特点:仅有首位为1,其余各位都为0.方法1: n & n-1 == 0class Solution {public: bool isPowerOfTwo(int n) {原创 2015-07-06 18:34:20 · 4389 阅读 · 2 评论 -
LeetCode 14: Longest Common Prefix
Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.求最长公共前缀。代码如下:class Solution {public: string longestCommonPrefix(vect原创 2015-07-30 19:04:07 · 1810 阅读 · 0 评论 -
LeetCode 240: Search a 2D Matrix II
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 in ascending from left to right.Integers in原创 2015-07-30 19:07:55 · 1717 阅读 · 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?判断一个单向链表是否是回文链表,要求O(n)的时间复杂度和O(1)的空间复杂度。算法有以下几种:1、遍历整个链表,将链表每个节点的值记录在数组中,再判断数组是不是一个回文数原创 2015-07-16 22:48:30 · 15946 阅读 · 3 评论