CodesKiller - 博客园

2017年2月11日

摘要： Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form 阅读全文

posted @ 2017-02-11 03:41 CodesKiller 阅读(294) 评论(0) 推荐(0)

47. Permutations II

摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe 阅读全文

posted @ 2017-02-11 01:47 CodesKiller 阅读(125) 评论(0) 推荐(0)

2017年2月10日

46. Permutations

摘要： Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2, 阅读全文

posted @ 2017-02-10 14:55 CodesKiller 阅读(148) 评论(0) 推荐(0)

回溯法

摘要：回溯法回溯法有“通用的解题法”之称。用它可以系统地搜索一个问题的所有解或任一解。回溯法是一种即带有系统性又带有跳跃性的搜索算法。它在问题的解空间树中，按深度优先策略，从根节点出发搜索解空间树。算法搜索至解空间树的任一结点时，先判断该节点是否包含问题的解。如果不包含，则跳过对以该节点为根的子树的搜索阅读全文

posted @ 2017-02-10 14:27 CodesKiller 阅读(674) 评论(0) 推荐(0)

31. Next Permutation

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文

posted @ 2017-02-10 13:56 CodesKiller 阅读(156) 评论(0) 推荐(0)

174. Dungeon Game

摘要： The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 阅读全文

posted @ 2017-02-10 13:03 CodesKiller 阅读(149) 评论(0) 推荐(0)

64. Minimum Path Sum

摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文

posted @ 2017-02-10 11:56 CodesKiller 阅读(108) 评论(0) 推荐(0)

63. Unique Paths II

摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space 阅读全文

posted @ 2017-02-10 11:44 CodesKiller 阅读(139) 评论(0) 推荐(0)

62. Unique Paths

摘要： 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 阅读全文

posted @ 2017-02-10 09:10 CodesKiller 阅读(119) 评论(0) 推荐(0)

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-02-10 08:50 CodesKiller 阅读(174) 评论(0) 推荐(0)

公告