HarryHuang1990-CSDN博客

原创 LeetCode: Reverse Words in a String [151]

【题目】Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Clarification:What constitutes a word?A sequence of non-space characters constitutes a word.

2014-07-01 19:40:35 1144

原创 LeetCode: Evaluate Reverse Polish Notation [150]

【题目】Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9 ["4", "13", "5", "/

2014-07-01 19:38:28 996

原创 LeetCode: Max Points on a Line [149]

【题目】Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.【题意】给定一堆点，要求找出一条之前上的最大点数【思路】没什么好的方法，从每个点P出发，遍历所有的情况从每个点P出发，斜率相同的点即为统一之前上的点注意两种特殊情况： 1. 两个点重合（即为同一个点）

2014-07-01 19:34:48 1088

原创 LeetCode: Sort List [148]

【题目】 Sort a linked list in O(n log n) time using constant space complexity.【题意】排序一个链表，要求时间复杂度O(nlogn)，使用常量空间【思路】 nlogn的复杂度，用归并排序求解

2014-07-01 19:32:12 932

原创 LeetCode: Insertion Sort List [147]

【题目】Sort a linked list using insertion sort.【题意】用插入排序方法排序链表【思路】直接搞

2014-07-01 19:30:07 902

原创 LeetCode: LRU Cache [146]

【题目】Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.se

2014-06-29 11:01:35 1176

原创 LeetCode: Binary Tree Postorder Traversal [145]

【题目】Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recursive solution is trivial, could you do it iteratively?【题意】非递归实现后续遍

2014-06-29 10:59:22 1000

原创 LeetCode: Binary Tree Preorder Traversal [144]

【题目】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 you do it iteratively?【题意】非递归返回先序遍历

2014-06-29 10:57:22 827

原创 LeetCode: Reorder List [143]

【题目】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}, reorder it to {1,4,2,3}.【题意】给定一个链表L: L0→L1→…→Ln-1→Ln,对他重新排序成L

2014-06-29 10:55:43 824

原创 LeetCode: Linked List Cycle II [142]

【题目】Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?【题意】给定一个单向链表，如果链表有环，则返回环开始的位置。【思路】仍然是维护两个指针, p1, p2, p1每次走一步, p2每次走两步

2014-06-29 10:53:31 773

原创 LeetCode: Linked List Cycle [141]

【题目】Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?【题意】判断一个单向链表是否有环【思路】维护两个指针p1和p2，p1每次向前移动一步，p2每次向前移动两步如果p2能够追上p1，则说明链表中存在环

2014-06-28 21:02:01 802

原创 LeetCode: Word Break II [140]

【题目】Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens = "catsanddog",dict = ["cat", "cats", "and", "sand", "dog

2014-06-28 20:59:46 982

原创 LeetCode: Word Break [139]

【题目】Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet", "code"].Return true because "leetcode" can be segm

2014-06-28 20:57:56 900

原创 LeetCode: Copy List with Random Pointer [138]

【题目】A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.【题意】给定一个链表，每个节点除了next指针外，还有一个random指针，指向任意的节点。要求，复制这样的一个链表【思路】思路

2014-06-28 20:55:11 901

原创 leetCode: Single Number II [137]

【题目】Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?【题意】给定一个整数以外，其中除了一个整数只出现一次以外

2014-06-28 20:52:29 820

原创 LeetCode: Single Number [136]

【题目】Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?【题意】给定一个整数数组，其中除了一个数以外，其他数都是成对出现的，

2014-06-25 22:12:31 864

原创 LeetCode: Candy [135]

【题目】There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one candy.Children with a higher rating get more candie

2014-06-25 22:10:41 897

原创 LeetCode: Gas Station [134]

【题目】There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an

2014-06-25 22:08:58 937

原创 LeetCode: Clone Graph [133]

【题目】Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each node, and , as a separator for node label and each ne

2014-06-25 22:06:18 854

原创 LeetCode: Palindrome Partitioning II [132]

【题目】Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = "aab",Return 1 since the palindrome partitioning ["aa","b"] could b

2014-06-25 22:03:37 733

原创 LeetCode: Palindrome Partitioning [131]

【题目】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","b"], ["a","a","b"] ]【题意】给定一个字符串s, 要求对s进行

2014-06-25 11:07:02 801

原创 LeetCode: Surrounded Regions [130]

【题目】Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X X XX O O XX X O XX O X XAfter running your function, the board shou

2014-06-24 19:14:06 1078

原创 LeetCode: Sum Root to Leaf Numbers [129]

【题目】Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total sum of all root-to-leaf numbers.For example, 1

2014-06-24 19:11:44 760

原创 LeetCode: Longest Consecutive Sequence [128]

【题目】Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.Your algorithm should run

2014-06-24 19:09:20 742

原创 LeetCode: Word Ladder II [127]

【题目】Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:start = "

2014-06-24 19:05:55 830

原创 LeetCode: Word Ladder [126]

【题目】Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:st

2014-06-24 19:01:36 918

原创 LeetCode: Valid Palindrome [125]

【题目】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 palindrome.Note:Have you consider that the string m

2014-06-22 18:31:54 764

原创 LeetCode: Binary Tree Maximum Path Sum [124]

【题目】Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.【题意】给定一棵二叉树，找出其中路径和最大的路径，然会返回最大路径和。本题中的路径不是从根节点到叶子节点这样的传统的路

2014-06-22 18:29:37 930

原创 LeetCode: Best Time to Buy and Sell Stock III [123]

【题目】Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You may not engage in multiple transactions at the same time (i

2014-06-22 18:27:24 918

原创 LeetCode: Best Time to Buy and Sell Stock II [122]

【题目】Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). H

2014-06-22 18:24:48 798

PersonalRank算法的Python实现

空空如也