码迷,mamicode.com
首页 >  
搜索关键字:medium    ( 2358个结果
SSM框架搭建+easyui增删改查
转载于:http://www.cnblogs.com/caiya928/p/4851686.html?utm_source=tuicool&utm_medium=referral 闲来无事,看了看别人的博客文档也跟着敲了敲,特地记录下来,方便以后学习: spring版本:4.0.6 mybatis版 ...
分类:其他好文   时间:2016-03-30 14:35:39    阅读次数:342
lintcode-medium-Maximal Square
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area. Example For example, given the follo ...
分类:其他好文   时间:2016-03-30 08:16:24    阅读次数:142
lintcode-medium-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. Example Given 4 points: (1,2), (3,6), (0,0), (1,3) ...
分类:其他好文   时间:2016-03-30 07:05:45    阅读次数:150
lintcode-medium-Majority Number III
Given an array of integers and a number k, the majority number is the number that occurs more than 1/k of the size of the array. Find it. Notice There ...
分类:其他好文   时间:2016-03-30 06:55:21    阅读次数:149
lintcode-medium-Longest Increasing Subsequence
Given a sequence of integers, find the longest increasing subsequence (LIS). You code should return the length of the LIS. Clarification What's the de ...
分类:其他好文   时间:2016-03-29 14:22:46    阅读次数:117
lintcode-medium-Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes ...
分类:其他好文   时间:2016-03-29 14:16:56    阅读次数:156
lintcode-medium-Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Clarification Your algorithm should run in O(n) com ...
分类:其他好文   时间:2016-03-26 10:34:48    阅读次数:127
lintcode-medium-Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim ...
分类:其他好文   时间:2016-03-24 13:05:38    阅读次数:123
C# winform生成天气预报(转)
原文地址 http://www.cnblogs.com/ChowYy/p/3382216.html?utm_source=tuicool&utm_medium=referral ...
分类:Windows程序   时间:2016-03-24 08:50:39    阅读次数:257
lintcode-medium-Interleaving String
Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2. For s1 = "aabcc", s2 = "dbbca" 动态规划,用一个二维数据记录:s1前i个字
分类:其他好文   时间:2016-03-23 09:04:27    阅读次数:153
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!