摘要：
``` / Source : https://oj.leetcode.com/problems/edit distance/ Given two words word1 and word2, find the minimum number of steps required to convert w 阅读全文
摘要：
``` import java.util.Stack; / Source : https://oj.leetcode.com/problems/simplify path/ Given an absolute path for a file (Unix style), simplify it. Fo 阅读全文
摘要：
``` / Source : https://oj.leetcode.com/problems/climbing stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you ca 阅读全文
摘要：
```java /** * Source : https://oj.leetcode.com/problems/sqrtx/ * * * Implement int sqrt(int x). * * Compute and return the square root of x. */ public class Sqrt { /** * 求x的平方根，这里要求的是... 阅读全文
摘要：
``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; / Source : https://oj.leetcode.com/problems/text justification/ Given 阅读全文
摘要：
```
/** * Source : https://oj.leetcode.com/problems/add-binary/ * * * Given two binary strings, return their sum (also a binary string). * * For example, * a = "11" * b = "1" * Return "100".
... 阅读全文
摘要：
``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/plus-one/ * * * Given a non-negative number represented as an array... 阅读全文
摘要：
``` /** * * Source : https://oj.leetcode.com/problems/valid-number/ * * * Validate if a given string is numeric. * * Some examples: * "0" => true * " 0.1 " => true * "abc" => false * "1 ... 阅读全文
摘要：
``` / Source : https://oj.leetcode.com/problems/minimum path sum/ Given a m x n grid filled with non negative numbers, find a path from top left to bo 阅读全文
摘要：
``` /** * Source : https://oj.leetcode.com/problems/unique-paths-ii/ * * * Follow up for "Unique Paths": * * Now consider if some obstacles are added to the grids. How many unique paths would th... 阅读全文