- 博客(12)
- 资源 (7)
- 收藏
- 关注
转载 ACM训练方案-POJ题目分类
(转载自这里)ACM online Judge中国:浙江大学(ZJU):http://acm.zju.edu.cn/ 北京大学(PKU):http://acm.pku.edu.cn/JudgeOnline/ 杭州电子科技大学(HDU):http://acm.hdu.edu.cn/ 中国科技大学(USTC):http://acm.ustc.edu.cn/ 北京航天
2014-03-13 04:15:28 2736
原创 LeetCode(73)Set Matrix Zeroes
题目如下:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using
2014-03-11 14:54:49 1115
原创 LeetCode(151)Reverse Words in a String
题目如下:Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".分析如下: 很基础的题目,需要考虑各种corner cases,比如下列:1 "
2014-03-10 02:47:53 4368
原创 LeetCode(149)Max Points on a Line
题目如下:Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.思考分析:一开始,我觉得这道题不是考算法的,题目确实不涉及算法的内容。但是后来,我交了很久才成功,才明白这道题的坑点在于corner cases.首先看解题方法。
2014-03-07 13:49:08 3321 2
原创 LeetCode(32)Longest Valid Parentheses
题目如下:Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",
2014-03-07 08:31:54 2676
原创 LeetCode(34)Search for a Range
题目如下:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not fou
2014-03-07 04:58:55 1875
原创 LeetCode(34)SearchInsertPosition
原始题目:Given 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 assume no duplicates in the a
2014-03-07 03:18:17 869
原创 LeetCode(90)Decode Ways
题目如下:A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the tot
2014-03-06 15:17:34 827
原创 [面试题]在一个先增长后减小的数组中找到最大值
题目如下:Given an array of integers. Find a peak element in it. An array element is peak if it is larger than its neighbors. For corner elements, we need to consider only one neighbor. For example, for
2014-03-06 02:04:16 11139 3
原创 LeetCode(54) SpiralMatrix
题目如下:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9
2014-03-05 15:29:56 972
原创 LeetCode(63)UniquePath2
题目如下: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
2014-03-05 02:54:10 1627
原创 LeetCode(61)UniquePath1
题目如下: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
2014-03-01 08:54:49 2295
数据挖掘--概念.模型.方法和算法
2009-09-20
机器学习 Tom Mitchell 中文版
2009-09-20
机器学习英文版Machine Learning(Mitchell)(下)
2009-09-14
机器学习英文版Machine Learning(Mitchell)(中)
2009-09-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人