逸朵 - 博客园

2017年11月22日

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文

posted @ 2017-11-22 02:36 逸朵阅读(166) 评论(0) 推荐(0)

Leetcode 130: Surrounded Regions

摘要： Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in 阅读全文

posted @ 2017-11-22 02:15 逸朵阅读(144) 评论(0) 推荐(0)

2017年11月21日

Leetcode 127: Word Ladder

摘要： Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文

posted @ 2017-11-21 13:09 逸朵阅读(170) 评论(0) 推荐(0)

2017年11月20日

Leetcode 122: Best Time to Buy and Sell Stock II

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2017-11-20 12:38 逸朵阅读(101) 评论(0) 推荐(0)

Leetcode 121: Best Time to Buy and Sell Stock

摘要： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文

posted @ 2017-11-20 12:31 逸朵阅读(134) 评论(0) 推荐(0)

Leetcode 115: Distinct Subsequences

摘要： Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is for 阅读全文

posted @ 2017-11-20 12:04 逸朵阅读(132) 评论(0) 推荐(0)

Leetcode 124: Binary Tree Maximum Path Sum

摘要： Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in th 阅读全文

posted @ 2017-11-20 11:32 逸朵阅读(143) 评论(0) 推荐(0)

Leetcode 120: Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文

posted @ 2017-11-20 09:28 逸朵阅读(140) 评论(0) 推荐(0)

Leetcode 118: Pascal's Triangle

摘要： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 阅读全文

posted @ 2017-11-20 09:12 逸朵阅读(116) 评论(0) 推荐(0)

Leet 145: Binary Tree Postorder Traversal

摘要： Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [3,2,1]. 阅读全文

posted @ 2017-11-20 05:30 逸朵阅读(138) 评论(0) 推荐(0)

Keep walking

公告