mrlonelyjtr's blog

写BUG的程序猿


  • Home

  • Categories

  • Archives

  • Tags

  • Search

[LeetCode] Problem 63 - Unique Paths II

Posted on 2017-09-24 | In Algorithm , LeetCode
A 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 p ...
Read more »

[LeetCode] Problem 62 - Unique Paths

Posted on 2017-09-24 | In Algorithm , LeetCode
A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to r ...
Read more »

[LeetCode] Problem 70 - Climbing Stairs

Posted on 2017-09-24 | In Algorithm , LeetCode
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
Read more »

[LeetCode] Problem 150 - Evaluate Reverse Polish Notation

Posted on 2017-09-18 | In Algorithm , LeetCode
Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e ...
Read more »

[LeetCode] Problem 20 - Valid Parentheses

Posted on 2017-09-18 | In Algorithm , LeetCode
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid if: Op ...
Read more »

[LeetCode] Problem 155 - Min Stack

Posted on 2017-09-18 | In Algorithm , LeetCode
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Remove ...
Read more »

[LeetCode] Problem 133 - Clone Graph

Posted on 2017-09-18 | In Algorithm , LeetCode
Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and ...
Read more »

[LeetCode] Problem 13 - Roman to Integer

Posted on 2017-09-18 | In Algorithm , LeetCode
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. Roman numerals are represented by seven di ...
Read more »

[LeetCode] Problem 12 - Integer to Roman

Posted on 2017-09-18 | In Algorithm , LeetCode
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. Roman numerals are represented by seven di ...
Read more »

[LeetCode] Problem 54 - Spiral Matrix

Posted on 2017-09-17 | In Algorithm , LeetCode
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. ExampleNo.1Input:[ [ 1, 2, 3 ], [ 4, 5, 6 ], ...
Read more »
1…676869…78
mrlonelyjtr

mrlonelyjtr

间歇性踌躇满志,持续性混吃等死

780 posts
18 categories
18 tags
Github
© 2020 mrlonelyjtr
Powered by Hexo
Theme - NexT.Pisces