Leet 第15页

LeetCode-Reverse Words in a String[AC源码]

1 package com.lw.leet1; 2 3 import java.util.Stack; 4 5 /** 6 * @ClassName:Solution 7

·2015-10-30 12:41

LeetCode-Insertion Sort List[AC源码]

1 package com.lw.leet5; 2 3 /** 4 * @ClassName:Solution 5 * @Description: 6 *

·2015-10-23 09:55

LeetCode-Max Points on a Line[AC源码]

1 package com.lw.leet3; 2 3 import java.util.HashMap; 4 import java.util.Iterator; 5 import

·2015-10-23 09:55

LeetCode-Sort List[AC源码]

package com.lw.leet4; /** * @ClassName:Solution * @Description: * Sort List *

·2015-10-23 09:55

LeetCode-Evaluate Reverse Polish Notation[AC源码]

1 package com.lw.leet2; 2 3 /** 4 * @ClassName:Solution 5 * @Description: 6 *

·2015-10-23 09:54

【Leet Code】Palindrome Number

Palindrome Number Total Accepted: 19369 Total Submissions: 66673 My Submissions Determine whether an integer is a palindrome. Do this without extra space. 推断一

·2015-10-23 08:33

LeetCode -- Word Break 动态规划，详细理解

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

Crazy兔子·2015-09-05 20:00

Leetcode: Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens=“leetcode”,dict=[“leet

ayst123·2015-08-29 12:00

Word Break && Word Break II

Forexample,given s="leetcode", dict=["leet"

yujin753·2015-08-26 21:00

Leet -- Plus One

题目描述：Givenanon-negativenumberrepresentedasanarrayofdigits,plusonetothenumber.Thedigitsarestoredsuchthatthemostsignificantdigitisattheheadofthelist.给定1个数组，完成加1的操作。本题和大整数加法非常类似。逻辑比较简单，直接实现就可以了当前位=num[i]

csharp25·2015-08-25 16:00

Leet -- Remove Duplicates from Sorted Array

题目描述：Givenasortedarray,removetheduplicatesinplacesuchthateachelementappearonlyonceandreturnthenewlength.Donotallocateextraspaceforanotherarray,youmustdothisinplacewithconstantmemory.Forexample,Givenin

csharp25·2015-08-22 22:00

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leet

derrantcm·2015-08-19 06:31

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leet

DERRANTCM·2015-08-19 06:00

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leet

DERRANTCM·2015-08-19 06:00

[leetcode 139]Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

ER_Plough·2015-08-04 16:00

[CareerCup] 3.2 Min Stack 最小栈

Leet

·2015-07-25 12:00

Leet Code -- Unique BST

对于数字n（大于1），从1到n有多少种binarysearchtree（BST序列）？当n=3时，BST序列为： 1 3 3 2 1 \ / / /\ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3共5种。分析：N=1时，BST序列为 1 / \ null null1种N=2时，B

csharp25·2015-07-23 12:00

LeetCode139:Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens=“leetcode”,dict=[“leet

u012501459·2015-07-02 00:00

leetcode_Multiply Strings

Thenumberscanbearbitrarilylargeandarenon-negative.思路：简而言之，要实现的就是BigInteger(a).Multiply(BigInteger(b))的功能，但很显然，leet

dfb198998·2015-06-30 17:00

leetcode--Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leetcode",dict=["leet

kangaroo835127729·2015-06-19 17:00

leetcode_Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens=“leetcode”,dict=[“leet

dfb198998·2015-06-19 10:00

[LeetCode] Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

wangshaner1·2015-06-17 17:00

LeetCode - Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

yuanhisn·2015-05-28 09:00

[LeetCode]Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

CiaoLiang·2015-05-21 10:00

[LeetCode]139.Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens=“leetcode”,dict=[“leet

SunnyYoona·2015-05-07 17:00

leetcode || 139、Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

hustyangju·2015-05-04 09:00

Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

brucehb·2015-04-26 02:00

LeetCode:Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

x_i_y_u_e·2015-04-15 15:00

【LeetCode】WordBreak动规解法

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens=“leetcode”,dict=[“leet

u011613729·2015-03-18 21:00

LeetCode-Word Break II

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

My_Jobs·2015-03-13 20:00

uva 1509 - Leet(暴力)

题目大意：给出k，表示一个字符可以对应k给字符编码，给出字符串1，问时候有符合的编码可以生成字符串2.解题思路：暴力枚举，对于每个碰到的字符记录对应的编码。#include #include intk,T,len_1,len_2; charstr[60],strMap[60],Map[256][50]; boolDFS(intpos_1,intpos_2){ if(pos_1==len_1||

kl28978113·2015-02-20 00:00

[LeetCode]171.Excel Sheet Column Number

跟 [Leet

SunnyYoona·2015-01-30 17:00

[LeetCode]171.Excel Sheet Column Number

跟 [Leet

SunnyYoona·2015-01-30 17:00

LeetCode：Spiral Matrix II

Given n = 3,Youshouldreturnthefollowingmatrix:[ [1,2,3], [8,9,4], [7,6,5] ]LeetCode：//Source:https://oj.leet

hnuzengchao·2015-01-27 22:00

[LeetCode] Word Break, Solution

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

lcj_cjfykx·2015-01-24 03:00

[C++]LeetCode: 112 Word Break(DP)

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

cinderella_niu·2015-01-20 11:00

LeetCode-Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leetcode",dict=["leet

LiBlog·2015-01-05 07:00

[LeetCode]Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

u014691362·2014-12-25 21:00

LeetCode：Single Number

//Source:https://oj.leet

hnuzengchao·2014-12-17 10:00

[LeetCode] word break 字符串的划分

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

jiyanfeng1·2014-12-02 13:00

Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leetcode",dict=["leet

zzyafyj·2014-11-30 22:00

LeetCode——Maximum Product Subarray

whichhasthelargestproduct.Forexample,giventhearray [2,3,-2,4],thecontiguoussubarray [2,3] hasthelargestproduct= 6.原题链接：https://oj.leet

ozhaohuafei·2014-11-21 18:00

LeetCode——Maximum Product Subarray

whichhasthelargestproduct.Forexample,giventhearray [2,3,-2,4],thecontiguoussubarray [2,3] hasthelargestproduct= 6.原题链接：https://oj.leet

ozhaohuafei·2014-11-21 18:00

[LeetCode] Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

hale1007·2014-10-22 19:00

【LeetCode】Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leetcode",dict=["leet

copica·2014-09-23 18:00

[LeetCode]Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

cjllife·2014-09-21 17:00

leetcode之Word Break

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

fangjian1204·2014-09-06 17:00

LeetCode: Combinations

n.Forexample,Ifn=4andk=2,asolutionis:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ] 地址：https://oj.leet

Boostable·2014-09-04 20:00

【LeetCode】Word Break 解题报告

canbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens = "leetcode",dict = ["leet

ljiabin·2014-08-31 19:00

LeetCode 13 Word Break

determineifscanbesegmentedintoaspace-separatedsequenceofoneormoredictionarywords.Forexample,givens="leetcode",dict=["leet

ustc_summer·2014-08-23 12:00

推荐频道

Leet

LeetCode-Reverse Words in a String[AC源码]

LeetCode-Insertion Sort List[AC源码]

LeetCode-Max Points on a Line[AC源码]

LeetCode-Sort List[AC源码]

LeetCode-Evaluate Reverse Polish Notation[AC源码]

【Leet Code】Palindrome Number

LeetCode -- Word Break 动态规划，详细理解

Leetcode: Word Break

Word Break && Word Break II

Leet -- Plus One

Leet -- Remove Duplicates from Sorted Array

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】

[leetcode 139]Word Break

[CareerCup] 3.2 Min Stack 最小栈

Leet Code -- Unique BST

LeetCode139:Word Break

leetcode_Multiply Strings

leetcode--Word Break

leetcode_Word Break

[LeetCode] Word Break

LeetCode - Word Break

[LeetCode]Word Break

[LeetCode]139.Word Break

leetcode || 139、Word Break

Word Break

LeetCode:Word Break

【LeetCode】WordBreak动规解法

LeetCode-Word Break II

uva 1509 - Leet(暴力)

[LeetCode]171.Excel Sheet Column Number

[LeetCode]171.Excel Sheet Column Number

LeetCode：Spiral Matrix II

[LeetCode] Word Break, Solution

[C++]LeetCode: 112 Word Break(DP)

LeetCode-Word Break

[LeetCode]Word Break

LeetCode：Single Number

[LeetCode] word break 字符串的划分

Word Break

LeetCode——Maximum Product Subarray

LeetCode——Maximum Product Subarray

[LeetCode] Word Break

【LeetCode】Word Break

[LeetCode]Word Break

leetcode之Word Break

LeetCode: Combinations

【LeetCode】Word Break 解题报告

LeetCode 13 Word Break