2017年11月_一个普通的本科生

原创 (算法分析Week12)Unique Paths II[Medium]

63.Unique Paths II[Medium] Unique Paths升级版

2017-11-26 14:31:25 240

原创 (算法分析Week12)Unique Paths[Medium]

62.Unique Paths[Medium]题目来源DescriptionA robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time.

2017-11-26 14:14:33 159

原创 (算法分析Week12)Count Numbers with Unique Digits[Medium]

357. Count Numbers with Unique Digits题目来源DescriptionGiven a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example: Given n = 2, return 91. (The answer should be th

2017-11-26 14:05:50 149

原创 (算法分析Week11)Swap Nodes in Pairs[Medium]

24.Swap Nodes in Pairs[Medium]题目来源DescriptionGiven a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorit

2017-11-18 21:58:10 343

原创 (算法分析Week11)Generate Parentheses[Medium]

22.Generate Parentheses题目来源DescriptionGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))",

2017-11-18 20:32:19 169

原创 (算法分析Week10)Letter Combinations of a Phone Number[Medium]

17. Letter Combinations of a Phone Number[Medium]题目来源DescriptionGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on

2017-11-09 13:59:26 241

原创 (算法分析Week10)Maximum Swap[Meduim]

670. Maximum Swap[Medium]题目来源DescriptionGiven a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get. Example1:

2017-11-09 13:46:27 240

原创 (算法分析Week10)ZigZag Conversion[Medium]

6.ZigZag Conversion[Medium]题目来源DescriptionThe string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for bette

2017-11-09 13:31:31 180

原创 (算法分析Week9)Remove Duplicates from Sorted Array[Easy]

10.26. Remove Duplicates from Sorted Array[Easy] 删除有序数组中的重复元素。

2017-11-05 14:00:40 154

原创 (算法分析Week9)Wildcard Matching[Hard]

44.Wildcard Matching[Hard] 外卡匹配，Leetcode

2017-11-05 13:45:09 214

原创 (算法分析Week9)Regular Expression Matching[Hard]

10.Regular Expression Matching[Hard] 正规表达式匹配，Leetcode

2017-11-05 13:34:12 267

Reed_Marshes