C++
文章平均质量分 67
Clairezz_
这个作者很懒,什么都没留下…
展开
-
[leetcode][回溯] Generate Parentheses
题目: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(()原创 2015-05-09 22:00:33 · 271 阅读 · 0 评论 -
[leetcode][hash] Anagrams
题目; Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. v1 76ms class Solution { public: //将单词按字母顺序排序后作为hash的key,字符串在strs中的原创 2015-06-30 15:46:09 · 319 阅读 · 0 评论 -
[leetcode][hash] Contains Duplicate III
题目: Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between原创 2015-07-08 16:22:19 · 306 阅读 · 0 评论 -
C++实现单例模式
class Singleton { //其他成员 private: Singleton(){ cout << "Hello Singleton!" << endl; }//私有构造函数 Singleton(const Singleton &);//拷贝构造函数,只声明不定义,这要当用户或友元想要拷贝构造该类的已存在实例时会出错。 Singleton & operator= (const S原创 2015-07-03 14:37:53 · 272 阅读 · 0 评论 -
[leetcode][trie] Implement Trie (Prefix Tree)
题目: Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { public: // Initialize your da原创 2015-08-18 13:56:07 · 335 阅读 · 0 评论