2015年01月_wyc1230

原创 LeetCode: Integer to Roman

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. class Solution { public: string intToRoman(int num) { string result;

2015-01-23 15:43:12 337

原创 LeetCode: Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings. class Solution { public: string longestCommonPrefix(vector &strs) { int index = 0; if(strs.s

2015-01-23 14:58:10 381

原创 LeetCode: 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. c

2015-01-23 14:27:02 358

原创 LeetCode: Divide Two Integers

Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. class Solution { public: int divide(int dividend, int divisor) { bool

2015-01-23 08:27:40 333

原创 LeetCode: Substring with Concatenation of All Words

You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without

2015-01-20 16:09:50 326

原创 LeetCode: 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 possible

2015-01-20 09:43:01 345

原创 LeetCode: Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring is "()",

2015-01-18 06:12:11 319

原创 LeetCode: 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-01-17 10:47:19 388

原创 LeetCode: 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

2015-01-17 09:41:24 332

原创 LeetCode: Valid Sudoku

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partially fille

2015-01-16 15:00:02 453

原创 LeetCode: Multiply Strings

Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. class Solution { public: st

2015-01-16 13:23:38 386

原创 LeetCode: 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,1]

2015-01-16 08:05:10 323

原创 LeetCode: First Missing Positive

Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses constant

2015-01-15 15:27:00 437

原创 LeetCode: 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 cover t

2015-01-14 15:17:58 377

原创 LeetCode: Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal i

2015-01-06 15:21:24 368

原创 LeetCode: Permutations II

Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and [2,1,1

2015-01-05 15:37:53 367

原创 LeetCode: Permutations

Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. class Sol

2015-01-05 15:07:08 333

原创 LeetCode: Rotate Image

You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? class Solution { public: void rotate(vector >

2015-01-05 14:14:20 348