Michael's Blog (Page 4)

Swap Two Nodes in Linked List

LintCode-511.Swap Two Nodes in Linked List [http://www.lintcode.com/en/problem/swap-two-nodes-in-linked-list/] > Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate values in the linked list. If v1

LintCode

Max Points on a Line

LintCode-186.Max Points on a Line [http://www.lintcode.com/en/problem/max-points-on-a-line/] > Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. > Example > Given 4 points: (1,2), (3,6), (0,0), (1,3). > The maximum number is 3.

LintCode

Majority Number

LintCode-46. Majority Number [http://www.lintcode.com/en/problem/majority-number/] > Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it. > Example > Given [1, 1, 1, 1, 2, 2, 2], return 1 > Challenge > O(n) time and

LintCode

Subarray Sum

LintCode-138.Subarray Sum [http://www.lintcode.com/en/problem/subarray-sum/] > Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number and the index of the last number. > Notice: There is at least one subarray that it's

LintCode

The Smallest Difference

LintCode-387.The Smallest Difference [http://www.lintcode.com/en/problem/the-smallest-difference/] > Given two array of integers(the first array is array A, the second array is array B), now we are going to find a element in array A which is A[i], and another element in array B which

LintCode

Interleaving Positive and Negative Numbers

LintCode-144.Interleaving Positive and Negative Numbers [http://www.lintcode.com/en/problem/interleaving-positive-and-negative-numbers/] > Given an array with positive and negative integers. Re-range it to interleaving with positive and negative integers. > Notice: You are not necessary to keep the original order of positive integers or negative integers. > Example: Given [-1, -2,

LintCode

Anagrams

LintCode-171.Anagrams [http://www.lintcode.com/en/problem/anagrams/] > Given an array of strings, return all groups of strings that are anagrams. > Notice: All inputs will be in lower-case. > Example > Given ["lint", "intl", "inlt", "code"], return ["lint", "inlt", "intl"]. > Given ["ab", "ba", "cd", "dc", "e"], return ["ab", "ba", "cd", "dc"

LintCode

Compare Strings

LintCode-55.Compare Strings [http://www.lintcode.com/en/problem/compare-strings] > Compare two strings A and B, determine whether A contains all of the characters in B. > The characters in string A and B are all Upper Case letters. > Notice: The characters of B in A are not necessary continuous or

LintCode

Two Strings Are Anagrams

LintCode-158.Two Strings Are Anagrams [http://www.lintcode.com/en/problem/two-strings-are-anagrams] > Write a method anagram(s,t) to decide if two strings are anagrams or not. > Clarification: What is Anagram? * Two strings are anagram if they can be the same after change the order of characters. > Example: Given s

LintCode

Binary Tree Path Sum

LintCode-376. Binary Tree Path Sum [http://www.lintcode.com/en/problem/binary-tree-path-sum/] > Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target. > A valid path is from root node to any of the leaf nodes. > Example: Given a binary

LintCode

Palindrome Partitioning

LintCode-136.Palindrome Partitioning [http://www.lintcode.com/en/problem/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. > Example: Given s = "aab", return: [ ["aa","b"], ["a","a","b"] ] public class Solution { /** * @param s: A string

LintCode

Maximum Subarray Difference

LintCode-45.Maximum Subarray Difference [http://www.lintcode.com/en/problem/maximum-subarray-difference/] > Given an array with integers. > Find two non-overlapping subarrays A and B, which |SUM(A) - SUM(B)| is the largest. > Return the largest difference. > Notice: The subarray should contain at least one number > Example: For [1, 2, -3,

LintCode

Maximum Subarray II

LintCode-42.Maximum Subarray II [http://www.lintcode.com/en/problem/maximum-subarray-ii/] > Given an array of integers, find two non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Return the largest sum. > Notice: The subarray should contain at least one number > Example: For given [1,

LintCode

Best Time to Buy and Sell Stock III

LintCode-151.Best Time to Buy and Sell Stock III [http://www.lintcode.com/en/problem/best-time-to-buy-and-sell-stock-iii/] > 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

LintCode

Partition Array by Odd and Even

LintCode-373.Partition Array by Odd and Even [http://www.lintcode.com/en/problem/partition-array-by-odd-and-even/] > Partition an integers array into odd number first and even number second. > Example: Given [1, 2, 3, 4], return [1, 3, 2, 4] > Challenge: Do it in-place. public class Solution { /** * @param nums: an array of integers

LintCode

Trapping Rain Water

LintCode-363.Trapping Rain Water [http://www.lintcode.com/en/problem/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. > Example: Given [0,1,0,2,1,0,1,3,2,1,

LintCode

Two Sum Closest

LintCode-533.Two Sum Closest [http://www.lintcode.com/en/problem/two-sum-closest/] > Given an array nums of n integers, find two integers in nums such that the sum is closest to a given number, target. > Return the difference between the sum of the two integers and the target. > Example: Given array

LintCode

Stack Sorting

LintCode-229.Stack Sorting [http://www.lintcode.com/en/problem/stack-sorting] > Sort a stack in ascending order (with biggest terms on top). > You may use at most one additional stack to hold items, but you may not copy the elements into any other data structure (e.g. array). > Given stack = | | |3|

LintCode

Construct Binary Tree from Inorder and Postorder Traversal

LintCode-72.Construct Binary Tree from Inorder and Postorder Traversal [http://www.lintcode.com/en/problem/construct-binary-tree-from-inorder-and-postorder-traversal/] > Given inorder and postorder traversal of a tree, construct the binary tree. > Notice: You may assume that duplicates do not exist in the tree. > Given inorder [1,2,3] and postorder [1,3,2]

LintCode

Maximum Subarray

LintCode-41.Maximum Subarray [http://www.lintcode.com/en/problem/maximum-subarray/] > Given an array of integers, find a contiguous subarray which has the largest sum. > Notice: The subarray should contain at least one number. > Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,

LintCode

Find the Connected Component in the Undirected Graph

LintCode-431.Find the Connected Component in the Undirected Graph [http://www.lintcode.com/en/problem/find-the-connected-component-in-the-undirected-graph/] > Find the number connected component in the undirected graph. Each node in the graph contains a label and a list of its neighbors. (a connected component (or just component) of an undirected graph is

LintCode

Implement Queue by Linked List II

LintCode-493.Implement Queue by Linked List II [http://www.lintcode.com/en/problem/implement-queue-by-linked-list-ii/] > Implement a Queue by linked list. Provide the following basic methods: > 1. push_front(item). Add a new item to the front of queue. 2. push_back(item). Add a new item to the back of

LintCode

Implement Queue by Linked List

LintCode-492.Implement Queue by Linked List [http://www.lintcode.com/en/problem/implement-queue-by-linked-list/] > Implement a Queue by linked list. Support the following basic methods: 1. enqueue(item). Put a new item in the queue. 2. dequeue(). Move the first item out of the queue, return it. This problem you need

LintCode

Implement Queue by Two Stacks

LintCode-40.Implement Queue by Two Stacks [http://www.lintcode.com/en/problem/implement-queue-by-two-stacks/] > As the title described, you should only use two stacks to implement a queue's actions. > The queue should support push(element), pop() and top() where pop is pop the first(a.k.a front) element in the

LintCode

Implement Stack by Two Queues

LintCode-494.Implement Stack by Two Queues [http://www.lintcode.com/en/problem/implement-stack-by-two-queues/] > Implement a stack by two queues. The queue is first in first out (FIFO). That means you can not directly pop the last element in a queue. For this question, you need to pay attention to the