LeetCode
文章平均质量分 69
别哔哔好伐
安静的coder
展开
-
leetcode-189.-Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as原创 2016-03-09 20:58:19 · 279 阅读 · 0 评论 -
leetcode-160-Intersection of Two Linked Lists
Intersection of Two Linked ListsWrite 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 →原创 2015-07-25 09:28:22 · 562 阅读 · 0 评论 -
leetcode-155-Min Stack
Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of t原创 2015-08-04 18:14:58 · 571 阅读 · 0 评论 -
leetcode-258-Add Digits
Add DigitsGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2.原创 2015-08-31 13:19:39 · 585 阅读 · 0 评论 -
leetcode-172-Factorial Trailing Zeroes
Factorial Trailing ZeroesGiven an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.求 n!中,末尾的0连续有多少个。例如 10!=10*原创 2015-08-31 19:25:09 · 506 阅读 · 0 评论 -
leetcode-67-Add Binary
Add BinaryGiven two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".两字符串表示的2进制数。求它们的和。直接模拟,从最后一位开始每一位都相加,结果保存在栈中。class Solut原创 2015-08-03 18:41:59 · 524 阅读 · 0 评论 -
leetcode-232-Implement Queue using Stacks
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.pe原创 2015-08-03 17:29:45 · 373 阅读 · 0 评论 -
leetcode-242-Valid Anagram
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 f原创 2015-08-01 21:27:47 · 725 阅读 · 0 评论 -
leetcode-234-Palindrome Linked List
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)。/** *原创 2015-07-19 11:39:12 · 408 阅读 · 0 评论 -
反转单链表
反转单链表1. 用数组将单链表的值存储在数组里。方法简单,但浪费空间。2. 遍历链表,从第二个节点开始,将每个节点的next指向前一个节点。原链表的最后一个节点变为头节点。3. 遍历链表,除第一个节点外,将每一个节点依次插到第一个节点后面。最后将第一个节点插到最后。way 2 :ListNode* reverse_1(ListNode* head){ L原创 2015-07-20 14:40:40 · 522 阅读 · 0 评论 -
leetcode-231-Power of Two
Power of TwoGiven an integer, write a function to determine if it is a power of two.判断给出的数,是否为2的次方,如1,2,4,8,16... 移位操作,2的次方的数,换位2进制表示,都是第一个为1 ,其后面都是0,。如8=1000class Soluti原创 2015-07-17 19:25:08 · 594 阅读 · 0 评论 -
leetcode-203-Remove Linked List Elements
Remove Linked List ElementsRemove 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原创 2015-07-16 19:11:13 · 483 阅读 · 0 评论 -
leetcode-237-Delete Node in a Linked List
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原创 2015-07-16 13:22:37 · 740 阅读 · 0 评论 -
leetcode-263-Ugly Number
Ugly Number Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly原创 2015-08-24 09:47:40 · 596 阅读 · 0 评论 -
leetcode-27-Remove Element
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原创 2015-07-16 20:16:40 · 495 阅读 · 0 评论 -
leetcode-169-Majority Element
Majority ElementGiven 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-emp原创 2015-06-30 20:20:47 · 399 阅读 · 0 评论 -
leetcode-292-Nim Game
Nim GameYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last原创 2015-10-18 20:20:42 · 409 阅读 · 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-07 22:46:05 · 304 阅读 · 0 评论 -
leetcode-338-Counting Bits
338. Counting BitsGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.原创 2016-03-19 11:09:40 · 1473 阅读 · 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"]输出所有 从根原创 2016-03-03 11:29:29 · 297 阅读 · 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 +原创 2016-03-02 18:11:32 · 284 阅读 · 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-02 16:49:54 · 270 阅读 · 0 评论 -
leetcode-326-Power of Three
Given an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?Credits:Special thanks to @dietpepsi for adding this原创 2016-01-11 23:22:00 · 571 阅读 · 0 评论 -
leetcode-102-Binary Tree Level Order Traversal
Binary Tree Level Order TraversalGiven 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,#,原创 2015-09-22 20:16:08 · 352 阅读 · 0 评论 -
leetcode-101-Symmetric Tree
Symmetric TreeFor example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following is not: 1 / \ 2 2 \ \ 3 3Note:B原创 2015-09-21 21:13:19 · 319 阅读 · 0 评论 -
leetcode-107-Binary Tree Level Order Traversal II
Binary Tree Level Order Traversal IIGiven 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 e原创 2015-09-23 18:36:06 · 379 阅读 · 0 评论 -
leetcode-110-Balanced Binary Tree
Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subt原创 2015-09-21 12:57:37 · 348 阅读 · 0 评论 -
leetcode-283-Move Zeroes
Move ZeroesGiven 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, 1原创 2015-09-21 13:20:51 · 335 阅读 · 0 评论 -
leetcode-111-Minimum Depth of Binary Tree
Minimum Depth of Binary TreeGiven 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原创 2015-07-23 22:04:57 · 509 阅读 · 0 评论 -
leetcode-104-Maximum Depth of Binary Tree
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf nod原创 2015-06-20 13:10:25 · 486 阅读 · 0 评论 -
leetcode-53-Maximum Subarray
Maximum SubarrayFind 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 suba原创 2015-07-10 16:47:29 · 432 阅读 · 0 评论 -
leetcode-153-Find Minimum in Rotated Sorted Array
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 ele原创 2015-07-15 22:24:33 · 444 阅读 · 0 评论 -
leetcode-168-Excel Sheet Column Title
Excel Sheet Column Title Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z原创 2015-07-29 12:21:07 · 566 阅读 · 0 评论 -
leetcode-235-Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Search TreeGiven 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 Wiki原创 2015-07-16 18:13:38 · 598 阅读 · 0 评论 -
leetcoder-50-Pow(x, n)
Pow(x, n) 可以直接用库函数pow(x,n)一步搞定,但明显这样就没意思了。参考快速幂取模二分,复杂度为O(logn)递归方法class Solution {public: double myPow(double x, int n) { if(n<0) return 1.0/myPow_1(x,-n);原创 2015-07-09 16:46:30 · 862 阅读 · 0 评论 -
leetcode-21-Merge Two Sorted Lists
Merge Two Sorted ListsMerge 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.合原创 2015-07-02 23:03:46 · 633 阅读 · 0 评论 -
leetcode-162-Find Peak Element
Find Peak ElementA 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 ar原创 2015-07-07 21:53:55 · 471 阅读 · 0 评论 -
leetcode-145-Binary Tree Postorder Traversal
Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3原创 2015-07-07 20:14:13 · 496 阅读 · 0 评论 -
leetcode-116-Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each NodGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate原创 2015-06-26 19:47:37 · 433 阅读 · 0 评论 -
leetcode-51-N-Queens
N-QueensThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions原创 2015-06-27 00:37:47 · 545 阅读 · 0 评论