- 博客(23)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 leetcode123. [DP]Best Time to Buy and Sell Stock III
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 complete at most two transactions.Note: You may not engag
2016-03-24 17:23:15
287
原创 leetcode122.[DP] 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 complete as many transactions as you like (ie, buy one and
2016-03-24 14:56:41
319
原创 leetcode121.[DP]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 (ie, buy one and sell one share of the stock), desi
2016-03-24 13:57:50
305
原创 leetcode322. [DP]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 c
2016-03-23 13:03:35
332
原创 leetcode63.[DP] 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 is marked as 1 and 0 respectively in the grid.For ex
2016-03-23 11:27:22
244
原创 leetcode62.[DP] 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 point in time. The robot is trying to reach the botto
2016-03-22 22:44:42
323
原创 leetcode303.[DP] Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example: Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1 sumRange(2, 5) -> -1 sumRange(0, 5
2016-03-22 22:15:40
317
原创 leetcode213. [DP]House Robber II
Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all
2016-03-22 21:43:47
289
原创 leetcode198.[DP]House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses
2016-03-22 21:07:00
258
原创 leetcode118 & 119. [Array]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] ] a[n,k]={a[n−1,k−1]+a[n−1,k]10
2016-03-22 20:29:53
301
原创 leetcode70.[DP] Climbing Stairs My Submissions Question
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?class Solution(object): def cli
2016-03-15 13:18:34
249
原创 leetcode263. [Math]Ugly Number
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it in
2016-03-10 18:26:26
268
原创 leetcode264.[DP][math][leep] Ugly Number II
问题描述 Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 1
2016-03-10 18:24:41
354
原创 leetcode171.[math] Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28 clas
2016-03-08 21:27:06
239
原创 推荐系统简述(2)基于近邻推荐方法
推荐问题可以定义为评估用户对物品的反馈，反馈类型大致分为三种：分级反馈（一星到五星）、二元反馈（喜欢/不喜欢、赞同/反对）和一元反馈（购买、访问等等）。两个最重要的问题：最优项(best item)和最优N项(top-N)。评测推荐系统效果主要方法：准确性。当有可用评分信息时候，用平均绝对误差(MAE)和均方根误差(RMAE)衡量，否则用准确率和召回率进行评估。基于用户评分，预测用户u对新物品i
2016-03-08 12:31:17
770
原创 leetcode292.[Array] Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the
2016-03-07 20:23:28
221
原创 leetcode283. [Array]Move Zeroes My Submissions Question
Total Accepted: 61817 Total Submissions: 141889 Difficulty: Easy Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.Fo
2016-03-07 20:22:48
240
原创 leetcode66.[Array] Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.class Solution(object): d
2016-03-07 20:22:02
214
原创 leetcode 27. [Array]Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.Subscribe
2016-03-07 20:21:21
214
原创 leetcode26. [Array]Remove Duplicates from Sorted Array
Total Accepted: 117053 Total Submissions: 354699 Difficulty: Easy Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate
2016-03-07 20:20:34
202
原创 python小练习
python 练习代码 练习1: 输入：年、月（1-12）、日（1-31） 打印出相应的月份、名称months=['Janary','February','March','April','May','June','July','August','September','October','November','December']endings=['st','nd','rd']+7*['th
2016-03-06 14:38:40
340
原创 python 小练习之山寨版markdown格式txt文件转html文件
本练习根据《python基础教程》课后练习一——《即时标记》改编 分为四个模块（不包括输出部分）：文本解析、规则制定、过滤、处理程序，顺序如下： 规则制定 Rule模块由action和condition两部分实现，就是在遍历规则的时候通过调用condition这个东西来判断是否符合当前规则。我们考虑了标题(H1Rule)、引用(GuideRule)、无序列表(ListItemRule&Li
2016-03-05 17:43:05
1028
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人