码迷,mamicode.com
首页 >  
搜索关键字:implement strstr    ( 2381个结果
LeetCode(31) Next Permutation
题目Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible or...
分类:其他好文   时间:2015-08-13 18:15:15    阅读次数:109
8.12 [LeetCode] 146 LRU Cache
QuestionlinkDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- ...
分类:系统相关   时间:2015-08-13 08:54:53    阅读次数:170
LeetCode(28)Implement strStr()
题目Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02): The signature of the function had been updated to ret...
分类:其他好文   时间:2015-08-12 19:29:29    阅读次数:108
EventBus学习
使用起来很方便:1. Implement any number of event handling methods in the subscriber: public void onEvent(AnyEventType event) {} 2. Register subscribers: event...
分类:其他好文   时间:2015-08-12 16:40:27    阅读次数:115
Next Permutation
ARRAY; Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the low...
分类:其他好文   时间:2015-08-12 11:31:26    阅读次数:99
[LeetCode] Implement Queue using Stacks
国际惯例,先上题目:Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from....
分类:其他好文   时间:2015-08-11 11:53:13    阅读次数:67
[LeetCode] Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top()...
分类:其他好文   时间:2015-08-11 11:45:08    阅读次数:110
字符串函数
1、        字符串输出 Echo()输出一个或多个字符串 Print()输出字符串 Printf()格式化输出字符串 2、        字符串的截取 Substr()对字符串进行指定数量的截取。 Substr(对象,开始位置(从0开始),长度) Strchr()strstr别名,查找一个字符串在另一个字符串第一次出现,返回字符串到结尾  strchr(对象,查找的字符) ...
分类:其他好文   时间:2015-08-11 01:27:50    阅读次数:127
leetcode:LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if ...
分类:系统相关   时间:2015-08-10 20:02:52    阅读次数:163
LeetCode 211. Add and Search Word - Data structure design
借用LeetCode 208. Implement Trie (Prefix Tree)中设计的字典树,特判查询字符为.时的情况即可。 注意: 成员变量的初始化应放在构造函数的initializing list而不是body中,使成员变量只被初始化一次,没有被再次赋值; 使用shared_ptr代替裸指针来管理内存。 代码: class TrieNode { public: T...
分类:其他好文   时间:2015-08-10 12:06:32    阅读次数:117
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!