算法
fitchliu
小小的身躯 大大的力量
展开
-
Binary Tree Maximum Path Sum ---lintcode
DescriptionGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree.给出一棵二叉树,寻找一条路径使其路径和最大,路径可以在任一节点中开始和结束(路径和为两个节点之间所在路径上的节点权值之和) 分析看到这个题目的第一眼,我想的是左边最大路径和加上右边的原创 2017-08-21 12:07:34 · 135 阅读 · 0 评论 -
Triangle
DescriptionGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.NoticeBonus point if you are able to do this using only O(n) extra原创 2017-09-11 14:30:20 · 173 阅读 · 0 评论 -
Maximum Product Subarray--lintcode
DescriptionFind the contiguous subarray within an array (containing at least one number) which has the largest product.ExampleFor example, given the array [2,3,-2,4], the contiguous subarray [2,3] has原创 2017-09-19 15:46:55 · 305 阅读 · 0 评论 -
Jump Game--lintcode
DescriptionGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine原创 2017-09-19 17:32:23 · 283 阅读 · 0 评论 -
Fast Power--lintcode
DescriptionCalculate the an % b where a, b and n are all 32bit integers.ExampleFor 2^31 % 3 = 2 For 100^1000 % 1000 = 0看到这题我想到了我之前做过一题pow(x,n).是求x^n.我用了两种方法 。一种是递归,一种是二进制。网址: http://blog.csdn.net/liu原创 2017-09-02 22:28:01 · 167 阅读 · 0 评论 -
Interleaving String--lintcode
DescriptionGiven three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2.ExampleFor s1 = “aabcc”, s2 = “dbbca” When s3 = “aadbbcbcac”, return true. When s3 = “aadbb原创 2017-09-12 11:30:13 · 211 阅读 · 0 评论 -
Unique Binary Search Trees--lintcode
DescriptionGiven n, how many structurally unique BSTs (binary search trees) that store values 1…n?ExampleGiven n = 3, there are a total of 5 unique BST’s.我的思路: 先列举 n=1 num=1,n=2,num=2,n=3,num=2+2+1原创 2017-09-21 13:08:04 · 186 阅读 · 0 评论 -
Unique Binary Search Trees II --lintcode
DescriptionGiven n, generate all structurally unique BST’s (binary search trees) that store values 1…n.Example Given n = 3, your program should return all 5 unique BST’s shown below.这道题比1难的就是不是返回个数,转载 2017-09-21 14:07:43 · 182 阅读 · 0 评论 -
Perfect Squares--lintcode
DescriptionGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.ExampleGiven n = 12, return 3 because 12 = 4 + 4 + 4 Given n = 13, r转载 2017-09-22 09:56:27 · 195 阅读 · 0 评论 -
Decode Ways --lintcode
DescriptionA message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encoded message containing digits, determine the tota原创 2017-09-22 17:10:22 · 156 阅读 · 0 评论 -
Climbing Stairs--lintcode
DescriptionYou 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?Example Given an exampl原创 2017-09-11 12:59:42 · 237 阅读 · 0 评论 -
Search Insert Position &&Search in Rotated Sorted Array &&Search in Rotated Sorted Array II
Search Insert PositionDescriptionGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assum原创 2017-08-31 09:43:10 · 242 阅读 · 0 评论 -
Minimum Path Sum--lintcode
DescriptionGiven 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.NoticeYou can only move either down or ri原创 2017-09-08 17:13:19 · 145 阅读 · 0 评论 -
Wiggle Sort && Wiggle SortII---lintcode
DescriptionGiven an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]….给你一个没有排序的数组,请将原数组就地重新排列满足如下性质 nums[0] <= nums[1] >= nums[2] <= nums[3]….Example Given原创 2017-08-21 13:06:13 · 218 阅读 · 0 评论 -
Expression Expand---lintcode
DescriptionGiven an expression s includes numbers, letters and brackets. Number represents the number of repetitions inside the brackets(can be a string or another expression).Please expand expression转载 2017-08-22 13:07:15 · 473 阅读 · 0 评论 -
Merge k Sorted Lists--lintcode
DescriptionMerge k sorted linked lists and return it as one sorted list.Analyze and describe its complexity.ExampleGiven lists: [ 2->4->null, null, -1->null ], return -1->2->4->null.看到这个题目,转载 2017-08-25 22:37:43 · 140 阅读 · 0 评论 -
Pow(x, n)---lintcode
DescriptionImplement pow(x, n).ExamplePow(2.1, 3) = 9.261 Pow(0, 1) = 0 Pow(1, 0) = 1这个题目很简单。for循环。挨个乘。就行。于是public double myPow(double x, int n) { // Write your code here double resul原创 2017-08-23 11:22:16 · 278 阅读 · 0 评论 -
House Robber--lintcode
DescriptionYou 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 adja原创 2017-09-13 12:59:29 · 291 阅读 · 0 评论 -
House Robber II---lintcode
DescriptionAfter 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 houses at this place are arr原创 2017-09-13 16:55:07 · 201 阅读 · 0 评论 -
Distinct Subsequences--lintcode
DescriptionGiven a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by dele原创 2017-09-14 10:30:39 · 210 阅读 · 0 评论 -
Word Break--lintcode
DescriptionGiven a string s and a dictionary of words dict, determine if s can be break into a space-separated sequence of one or more dictionary words.给出一个字符串s和一个词典,判断字符串s是否可以被空格切分成一个或多个出现在字典中的单词Examp原创 2017-09-15 11:05:33 · 200 阅读 · 0 评论 -
Unique Paths--lintcode
DescriptionA robot is located at the top-left corner of a m x n grid.The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid.转载 2017-09-07 22:17:16 · 180 阅读 · 0 评论 -
协同过滤算法代码
此算法主要用来推荐的. //找出ui,uj两个用户同时打过分的课程集合 function getPSet($uid, $ujd) { //"select 课程编号 from 评分 where 用户编号=@ui and 课程编号 in (select 课程编号 from 评分 where 用户编号=@uj)"; $db=M('videoscore');...原创 2018-05-22 22:40:39 · 1837 阅读 · 0 评论