- 博客(5)
- 问答 (1)
- 收藏
- 关注
原创 吝啬SAT问题
问题描述: 吝啬SAT问题:给定一组子句(每个子句都是其中文字的析取)和整数k,求一个最多有k个变量为true的满足赋值——如果该赋值存在。证明吝啬问题是NP-完全问题。证明: (1)证明吝啬SAT是NP问题; 假设x是一组与吝啬SAT问题中变量对应的赋值,x是否是可以使这个吝啬SAT问题为真的解,这是可在多项式时间内验证的,所以吝啬SAT是NP问题 。(2)证明吝啬SAT是NP-完全问题;
2017-12-31 23:03:49 327
原创 Combination Sum IV
原题链接: https://leetcode.com/problems/combination-sum-iv/description/原题: Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a posi
2017-12-24 23:32:50 220
原创 Gas Station
原题链接: https://leetcode.com/problems/gas-station/description/题目: There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank
2017-12-17 22:58:08 203
原创 Triangle
原题链接:https://leetcode.com/problems/triangle/description/Description: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.Solution
2017-12-10 22:13:44 233
原创 Coin Change
原题链接: https://leetcode.com/problems/coin-change/description/题目: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins
2017-12-03 21:46:08 211
空空如也
在安装Ubuntu时,用easyBCD添加启动项时出现这样的问题怎么办?求助。
2016-07-27
TA创建的收藏夹 TA关注的收藏夹
TA关注的人