码迷,mamicode.com
首页 >  
搜索关键字:maximum    ( 4142个结果
leetcode笔记:Maximum Product of Word Lengths
题目大意:给定一个字符串数组words,寻找length(words[i]) * length(words[j])的最大值,其中words[i]和words[j]两个单词不包含相同的字母。你可以假设每一个单词只包含小写字母。如果不存在这样的两个单词,结果返回0。...
分类:其他好文   时间:2016-03-07 19:21:04    阅读次数:149
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 assum
分类:其他好文   时间:2016-03-06 17:18:00    阅读次数:155
Java [Leetcode 122]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
分类:编程语言   时间:2016-03-06 17:12:08    阅读次数:164
[基础] 一些英文术语
MLE: maximum likelihood estimate 最大似然估计 OLS: Ordinary Least Squares 普通最小二乘法 LSE: Least Squares Estimate 最小二乘估计 IRLS: Iteratively Reweighted Least Squa
分类:其他好文   时间:2016-03-04 13:13:34    阅读次数:137
移动web初体验
1.可视宽度、物理宽度、虚拟宽度,通常自适应都是可视宽度满屏。即设置meta <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no"> 2.css 媒
分类:移动开发   时间:2016-03-02 20:08:42    阅读次数:173
LeetCode 124. Binary Tree Maximum Path Sum
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x),
分类:其他好文   时间:2016-03-02 20:04:23    阅读次数:178
手机页面可视区域
<meta content="width=device-width; initial-scale=1.0; minimum-scale=1.0; maximum-scale=1.0" name="viewport"> content属性值 : width:可视区域的宽度,值可为数字或关键词devic
分类:移动开发   时间:2016-03-02 10:48:13    阅读次数:147
手机移动端WEB资源整合
meta基础知识 H5页面窗口自动调整到设备宽度,并禁止用户缩放页面 <meta name="viewport" content="width=device-width,initial-scale=1.0,minimum-scale=1.0,maximum-scale=1.0,user-scalab
分类:移动开发   时间:2016-02-28 11:01:52    阅读次数:567
ZOJ3201(树形DP)
Tree of TreeTime Limit: 1 Second Memory Limit: 32768 KB You're given a tree with weights of each node, you need to find the maximum subtree of specifi
分类:其他好文   时间:2016-02-27 22:07:07    阅读次数:167
lintcode-easy-Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l
分类:其他好文   时间:2016-02-27 08:27:45    阅读次数:153
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!