leetcode
文章平均质量分 58
孤独的根号13
这个作者很懒,什么都没留下…
展开
-
leetcode 链表排序
对链表排序,用归并排序。题目要求空间时间复杂度为O(nlogn),但是空间复杂度为O(1)1.自己写的程序,时间复杂度为O(nlogn),但是空间复杂度为O(n)用快慢指针(分别走2步和1步)找到中间节点。但是最后排序的部分,用复制将排好序的部分粘贴会原来链表中,这个方法比较笨,而且增加空间复杂度,并不满足题目要求void mergesort(ListNode* head, ListN原创 2016-04-05 17:46:33 · 488 阅读 · 0 评论 -
leetcode Reorder List
题意:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reord原创 2016-04-06 15:46:27 · 271 阅读 · 0 评论 -
power(x,n)
求x的n次,几个考虑点:1.n=02.n3.n=integer.min (负数)参考别人的代码如下:double myPow(double x, int n) { if(n==0) return 1; long p = 0; if(n>0) p = (long)(n); el原创 2016-04-06 21:03:09 · 593 阅读 · 0 评论 -
61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.刚开始没看懂题意,不知道旋转的k是怎么定义的,后来看了别人的博客才原创 2016-04-07 19:34:25 · 281 阅读 · 0 评论 -
Minimum Size Subarray Sum
题目:Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the a原创 2016-04-11 23:09:29 · 276 阅读 · 0 评论 -
Reverse Nodes in k-Group(与leetcode不同)
没有理解题目是什么意思,但是自己实现了另一种情况。/* 这道题我是这样做的,但貌似与题意不符合: Input: [0,3,8,4,1,9,3] 9 Output: [3,0,4,8,9,1,3] 若ksum, 则翻转k%sum次;若k=1或者k%sum=1,则return head */ListNode* reverseKGroup(ListNode原创 2016-04-08 16:21:38 · 255 阅读 · 0 评论 -
Basic Calculator II
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2016-04-25 20:39:48 · 249 阅读 · 0 评论 -
Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2016-04-26 20:01:10 · 225 阅读 · 0 评论 -
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2016-04-26 20:50:05 · 208 阅读 · 0 评论 -
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()原创 2016-04-26 21:53:55 · 274 阅读 · 0 评论 -
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 order red, white and blue.Here, we will use the integers原创 2016-04-10 15:31:58 · 275 阅读 · 0 评论 -
two sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example:Given nums =原创 2016-04-10 17:16:28 · 219 阅读 · 0 评论 -
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 t原创 2016-04-10 20:17:11 · 218 阅读 · 0 评论 -
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 i原创 2016-04-11 10:23:45 · 181 阅读 · 0 评论 -
Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain du原创 2016-04-28 15:42:34 · 322 阅读 · 0 评论 -
Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2016-04-28 17:02:03 · 256 阅读 · 0 评论 -
Subsets
Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For原创 2016-04-28 22:27:27 · 233 阅读 · 0 评论 -
Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2016-04-28 23:05:11 · 304 阅读 · 0 评论 -
Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Ensure that numbers wi原创 2016-04-29 15:35:39 · 246 阅读 · 0 评论 -
230. Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the原创 2016-05-24 22:05:46 · 356 阅读 · 0 评论 -
Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku原创 2016-04-30 17:47:17 · 289 阅读 · 0 评论 -
move_zero(linklist version)
题目: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原创 2016-04-17 11:13:30 · 257 阅读 · 0 评论 -
222. Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely fille原创 2016-05-25 21:15:12 · 226 阅读 · 0 评论 -
Minimum Window Substring
题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum windo原创 2016-04-18 20:04:12 · 416 阅读 · 0 评论 -
Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","原创 2016-05-03 11:44:02 · 279 阅读 · 0 评论 -
Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3原创 2016-04-29 11:09:25 · 272 阅读 · 0 评论 -
将序列按照想要的排序,去重
将一段序列按照字典序排序,去重,按照长度大小排序,相等长度按照字典序排序。c++ primer中的一段程序#include #include using namespace std;void elimDups(vector &words){ //按字典序排序words,以便查找重复单词 sort(words.begin(), words.end()); //un原创 2016-05-26 19:52:53 · 875 阅读 · 0 评论 -
Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,原创 2016-04-18 21:23:35 · 232 阅读 · 0 评论 -
奇数偶数序列
给定一串奇数偶数链表,将奇数排在前面,偶数排在后面。Given 1->2->3->4->5->NULL,return 1->3->5->2->4->NULL.注:不是leetcode的那道Odd Even Linked ListListNode* oddEvenList(ListNode* head) { if(head == NULL || head->n原创 2016-04-19 14:49:14 · 1980 阅读 · 0 评论 -
337. House Robber III
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour原创 2016-05-26 21:41:00 · 243 阅读 · 0 评论 -
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order原创 2016-05-03 22:50:06 · 337 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node.原创 2016-05-27 11:46:35 · 255 阅读 · 0 评论 -
建立二叉树
建立二叉树如对{1,2,2,3,3,null, null, 4,4}输入{1,2,2,3,3,0,0,4,4}TreeNode* create(vectorvec,int num){ TreeNode* root = new TreeNode(vec[0]); queue q; q.push(root); int i = 1; while(i <原创 2016-05-24 21:17:29 · 537 阅读 · 0 评论 -
98. Validate Binary Search Tree(提交了好几次,终于.....)
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th原创 2016-05-27 14:08:46 · 313 阅读 · 0 评论 -
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 solu原创 2016-04-19 21:15:49 · 253 阅读 · 0 评论 -
Next Permutation
题目大意:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest pos原创 2016-04-19 23:17:22 · 220 阅读 · 0 评论 -
113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \原创 2016-05-27 22:01:15 · 241 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.1.我的首先想法(递归建树) 但是超时了/** * Definition for a bin原创 2016-05-28 16:19:19 · 242 阅读 · 0 评论 -
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-05-05 10:29:15 · 253 阅读 · 0 评论 -
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 symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2016-05-05 11:33:15 · 344 阅读 · 0 评论