算法
文章平均质量分 62
yoshi park
这个作者很懒,什么都没留下…
展开
-
动态规划解152. Maximum Product Subarray
题目Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest pro原创 2017-09-23 16:54:51 · 306 阅读 · 0 评论 -
动态规划解343. Integer Break
题目Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return原创 2017-12-04 23:37:46 · 226 阅读 · 0 评论 -
306. Additive Number解题报告
题目Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the s原创 2017-11-26 18:10:32 · 268 阅读 · 0 评论 -
319. Bulb Switcher解题报告
题目There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off原创 2017-11-26 20:51:26 · 153 阅读 · 0 评论 -
动态规划解322. Coin Change
题目You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money原创 2017-11-26 21:44:28 · 241 阅读 · 0 评论 -
动态规划解221. Maximal Square
题目Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.For example, given the following matrix: 1 0 1 0 0 1 0 1 1 1 1 1 1 1 1原创 2017-12-05 23:03:41 · 182 阅读 · 0 评论 -
动态规划解338. Counting Bits
题目Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example:For num = 5 you s原创 2017-12-05 23:57:23 · 220 阅读 · 0 评论 -
回溯法解332. Reconstruct Itinerary
题目Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, t原创 2017-11-27 10:40:35 · 270 阅读 · 0 评论 -
动态规划解368. Largest Divisible Subset
题目Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, retu原创 2017-12-24 00:43:49 · 437 阅读 · 0 评论 -
动态规划解377. Combination Sum IV
题目Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.nums = [1, 2, 3]target = 4The possible combinat原创 2017-12-24 12:02:24 · 196 阅读 · 0 评论 -
动态规划解337. House Robber III
题目The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tou原创 2017-12-04 23:04:36 · 191 阅读 · 0 评论 -
318. Maximum Product of Word Lengths解题报告
题目Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case let原创 2017-12-04 09:21:10 · 176 阅读 · 0 评论 -
357. Count Numbers with Unique Digits解题报告
题目Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x 10^n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x 100, excludi原创 2017-12-10 12:28:12 · 192 阅读 · 0 评论 -
DFS解207. Course Schedule(判断有向图是否存在环)
题目There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai原创 2017-09-23 20:42:55 · 373 阅读 · 0 评论 -
二进制逻辑运算求解137. Single Number II
题目Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you原创 2017-09-08 22:15:05 · 710 阅读 · 0 评论 -
二进制逻辑运算求解187. Repeated DNA Sequences
题目All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: “ACGAATTCCG”. When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Write原创 2017-09-18 16:03:50 · 1139 阅读 · 1 评论 -
209. Minimum Size Subarray Sum解题报告
题目Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead.For example, given the arra原创 2017-10-10 21:21:04 · 447 阅读 · 0 评论 -
拓扑排序解210. Course Schedule II
题目There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai原创 2017-10-11 15:28:09 · 175 阅读 · 0 评论 -
人工智能:模拟退火初始温度值的计算
1.模拟退火法简介模拟退火法是一种状态空间的局部搜索算法,它属于比较通用的寻找最优解的算法。模拟退火算法从某一较高初温出发,伴随温度参数的不断下降,结合概率突跳特性在解空间中随机寻找目标函数的全局最优解,即在局部最优解能概率性地跳出并最终趋于全局最优。2.模拟退火法算法描述function Simulated-Annealing(problem, schedule) returns a soluti原创 2017-10-12 01:47:32 · 13027 阅读 · 0 评论 -
动态规划解174Dice Possibility
题目描述What is possibility of rolling N dice and the sum of the numbers equals to M?输入Two integers N and M. (1 ≤ N ≤ 100, 1 ≤ M ≤ 600)输出Output the possibility in percentage with 2 decimal places.样例输入2 8样例原创 2017-10-30 23:02:45 · 193 阅读 · 0 评论 -
274. H-Index解题报告
题目Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index.According to the definition of h-index on Wikipedia: “A sci原创 2017-10-24 20:55:08 · 274 阅读 · 0 评论 -
并查集解1335 : Email Merge(hihocoder)
题目描述You are given a list of usernames and their email addresses in the following format:alice 2 alice@hihocoder.com alice@gmail.combob 1 bob@qq.comalicebest 2 alice@gmail.com alice@qq.com alice2016 1 a原创 2017-10-16 20:56:35 · 521 阅读 · 0 评论 -
算法概论chapter8-8.15解题报告
题目最大公共子图:证明如下问题是NP-完全的:输入:两个图G1=(V1,E1)和G2=(V2,E2);预算b输出:两个节点集合V1’和V2’分别是V1和V2的子集,它们被移除后,将在两图中分别留下至少b个节点,且图的剩余部分完全一样题意分析给定两个图G1,G2,G1去掉一些定点V1’,G2去掉一些定点V2’之后,两个图都得到结点数至少为b的子图,且这两个子图完全相同。证明要证一个问题是NP-com原创 2017-12-28 16:47:00 · 221 阅读 · 0 评论