Given a m x n grid filled with non-negative numbers, find a path from top left to bottom r…
分类:LeetCode
LeetCode | Merge Two Sorted Lists(合并两个链表)
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together th…
LeetCode | Add Binary(二进制相加)
Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Ret…
LeetCode | Plus One(数组表示的数字加1)
Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored s…
LeetCode | Partition List(partition方法处理链表)
Given a linked list and a value x, partition it such that all nodes less than x come before nod…
LeetCode | Decode Ways(译码方式)
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -…
LeetCode | Scramble String(字符交换)
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings re…
LeetCode | Recover Binary Search Tree(恢复二叉搜索树)
wo elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its struct…
LeetCode | Restore IP Addresses(恢复ip地址)
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For…
LeetCode | Best Time to Buy and Sell Stock III(股票购买抛售问题III)
Say you have an array for which the ith element is the price of a given stock on day i. Design …
LeetCode | Word Ladder II(单词梯II)
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from…
LeetCode | Word Ladder(单词梯)
Given two words (start and end), and a dictionary, find the length of shortest transformation sequen…