- 博客(20)
- 资源 (6)
- 收藏
- 关注
原创 leetcode 日经贴,Cpp code -Majority Element II
Majority Element IIclass Solution {public: vector majorityElement(vector& nums) { int n = nums.size(); if (n <= 1) { return nums; } vector ret;
2015-06-29 11:57:57 541
原创 leetcode 日经贴,Cpp code -Summary Ranges
Summary Rangesclass Solution {public: string i2s(long long n) { string ret, neg; if (n < 0) { neg = "-"; n = -n; } if (n == 0) {
2015-06-27 23:45:50 323
转载 python yield keyword
http://pyzh.readthedocs.org/en/latest/the-python-yield-keyword-explained.html
2015-06-23 12:50:44 381
原创 python opencv face detection
just for funerror: OpenCV Error: Assertion failed (scn == 3 || scn == 4) in cvtColor ...http://bbs.csdn.net/topics/390944170http://blog.sina.com.cn/s/blog_79496d6b0100qy6t.html尝试安装解码器,
2015-06-14 01:15:27 955
原创 mac install python opencv module
1.下载Homebrew 在Terminal中输入:ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/master/install)"2.安装cmake 在Terminal中输入:brew install cmake开始安装opn
2015-06-13 16:00:27 422
原创 leetcode 日经贴,Cpp code -Invert Binary Tree
Invert Binary Tree/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(N
2015-06-13 12:26:58 307
原创 leetcode 日经贴,Cpp code -Basic Calculator
Basic Calculatorclass Solution {private: char token; int pos, num; stack ops; stack vals; int getpriority(char op) { int ret = 0; switch(op) { case
2015-06-11 18:52:31 370
原创 leetcode 日经贴,Cpp code -Implement Stack using Queues
Implement Stack using Queuesclass Stack { queue q; int topval;public: // Push element x onto stack. void push(int x) { q.push(x); topval = x; } // Removes
2015-06-11 17:22:11 417
原创 传媒板块
2015-06-11 01-03从图上看还处于涨势的股票有歌华有线(600037.SZ)长江传媒(600757.SZ)新华传媒(600825.SZ)中南传媒(601098.SZ)皖新传媒(601801.SZ)凤凰传媒(601928.SZ)吉视传媒(601929.SZ)
2015-06-11 01:06:06 622
原创 bootstrap static modal
modal 显示后,点击空白处不去 hide modal modal × Modal title {backdrop:"stati
2015-06-08 13:50:24 635
原创 leetcode 日经贴,Cpp code -Count Complete Tree Nodes
Count Complete Tree Nodes/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL),
2015-06-08 11:50:39 298
原创 leetcode 日经贴,Cpp code -Maximal Square
Maximal Squareclass Solution {public: int maxhist(vector &hist) { int n = hist.size(); int maxarea = 0; stack > st; st.push(make_pair(-1, -1)); for (in
2015-06-04 18:19:27 336
原创 python re-raise exception
refer http://www.ianbicking.org/blog/2007/09/re-raising-exceptions.htmldef exception(): raise ValueError('A very specific bad thing happend')def callException():# exception() try: except
2015-06-04 11:49:39 1476
原创 leetcode 日经贴,Cpp code -Contains Duplicate III
Contains Duplicate IIIclass Solution {public: long long abs(long long k) { return k>0? k:-k; } bool containsNearbyAlmostDuplicate(vector& nums, int k, int t) { if (k <
2015-06-03 14:20:40 366
原创 where is the chrome exension in my computer
C:\Users\lennovo\AppData\Local\Google\Chrome\User Data\Default\ExtensionsThe default locations of Chrome's profile directory are defined at http://www.chromium.org/user-experience/user-data-
2015-06-03 12:49:43 428
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人