码迷,mamicode.com
首页 >  
搜索关键字:make: command not fo    ( 1841个结果
最大连续子序列和的问题
问题描述 : 数组 int A[] = {-4 , 3 ,56 , -15 , 34 , 0 , -14 , 4} ; 某几个连续的子序列其和最大,比如A0+A1 = -1 。A1+A2+A3+A4 = 78 。则A1,A2,A3,A4组成的数组即是所求。解决方案:1.暴力求解O(n3) 两层fo....
分类:其他好文   时间:2014-11-11 19:05:17    阅读次数:181
解决zabbix图中出现中文乱码问题
我这周部署了zabbix监控服务器,但是配置过程中发现当有中文时,图中的中文会变成方块如下图所示:这个问题是由于zabbix的web端没有中文字库,我们最需要把中文字库加上即可解决办法如下1.从windows下控制面板->字体->选择一种中文字库例如“楷体”2.把它拷贝到zabbix的web端的fo...
分类:其他好文   时间:2014-11-11 18:35:36    阅读次数:286
零长数组
Arrays of Length Zero 这样说: Zero-length arrays are allowed in GNU C. They are very useful as the last element of a structure that is really a header fo...
分类:编程语言   时间:2014-11-10 19:22:07    阅读次数:225
css tricks
http://css-tricks.com/styling-cross-browser-compatible-range-inputs-css/http://css-tricks.com/browser-support-pseudo-elements/http://css-tricks.com/fo...
分类:Web程序   时间:2014-11-10 15:01:20    阅读次数:172
Mac上RoR环境搭建问题
昨天一晚上折磨的我啊都快疯掉了。按照http://railstutorial-china.org方法配制,到rvm requirements这个命令执行时就麻烦事来了。WutekiMacBook-Pro:~ wuxj$ rvm requirementsChecking requirements fo...
分类:系统相关   时间:2014-11-10 01:04:02    阅读次数:345
[LeetCode] Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-11-09 23:41:43    阅读次数:201
Binary Tree Level Order Traversal
Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).Fo...
分类:其他好文   时间:2014-11-09 16:26:48    阅读次数:127
POJ2718 Smallest Difference 【贪心+枚举】
Smallest Difference Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4639   Accepted: 1290 Description Given a number of distinct decimal digits, you can fo...
分类:其他好文   时间:2014-11-08 16:44:18    阅读次数:284
Leetcode-Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-11-08 13:35:55    阅读次数:144
Leetcode-Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo...
分类:其他好文   时间:2014-11-08 09:15:14    阅读次数:187
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!