[LeetCode] 747. Min Cost Climbing Stairs

Problem: On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb...

2018-01-03 21:03:40

阅读数 80

评论数 0

[LeetCode] 394. Decode String

Problem: Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square...

2018-01-02 12:31:57

阅读数 63

评论数 0

[证明] NP-完全问题

算法概论(注释版)第八章 Exercise 8.3 题目描述: STINGY SAT is the following problem: given a set of clauses(each a disjunction of literals) and an integer k, find ...

2018-01-01 11:09:28

阅读数 75

评论数 0

取消 删除