码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
条款3:尽可能使用const(use const whenever possible)
1.只要这(某值保持不变)是事实,就应该确实说出来,这样可以获得编译器的协助,确保这条约束不被违反。2.keyword const 有很多种用法,但都简单易用。 2.1classes 外部修饰global/namespace作用域中的常量。 2.2修饰文件、函数、区块作用域中被声明的static.....
分类:其他好文   时间:2015-08-27 22:52:29    阅读次数:119
UVA 题目1223 - Editor(后缀数组求出现次数超过两次的最长子串的长度)
Mr. Kim is a professional programmer. Recently he wants to design a new editor which has as many functions as possible. Most editors support a simple search function that finds one occurrence (or all ...
分类:编程语言   时间:2015-08-27 00:25:43    阅读次数:198
poj2362Square
Square Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 21988   Accepted: 7691 Description Given a set of sticks of various lengths, is it possible to join th...
分类:其他好文   时间:2015-08-26 15:50:24    阅读次数:189
POJ 3624 Charm Bracelet (01)(背包入门)
DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from...
分类:其他好文   时间:2015-08-25 14:10:14    阅读次数:113
HDU1159-Common Subsequence
描述: A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = ...
分类:其他好文   时间:2015-08-21 23:08:07    阅读次数:160
Item 3:尽量使用常量 Effective C++笔记
Item 3: Use const whenever possible 尽量使用常量。不需多说,这是防卫型(defensive)程序设计的原则, 尽量使用常量限定符,从而防止客户错误地使用你的代码。 常量的声明 总结一下各种指针的声明方式吧: char greeting[] = "Hello"; char *p = greeting; ...
分类:编程语言   时间:2015-08-20 15:24:53    阅读次数:192
[CareerCup] 5.6 Swap Odd and Even Bits 交换奇偶位
5.6 Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 a...
分类:其他好文   时间:2015-08-20 07:58:25    阅读次数:111
POJ 3624 (01背包)
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤...
分类:其他好文   时间:2015-08-20 01:07:01    阅读次数:189
leetcode -day31 Subsets I II
1、??SubsetsGiven a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set ...
分类:其他好文   时间:2015-08-18 21:15:41    阅读次数:136
poj_1458 LCS problem F.最长上升公共子序列
DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence....
分类:其他好文   时间:2015-08-18 11:31:13    阅读次数:119
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!