2015年04月_freshXD

原创 Effective C++ 阅读笔记

terms abstract abstraction access access level access function adapter address-of operator aggregation function binary operator 二元操作符 binding 绑定 bitwise 以位为单位逐…

2015-04-17 19:50:37 339

原创 self-cultivation

what is recursion? repeat a process in a self-similar manner. in programming language For example, if two mirrors are put parallel with each other, the nested images that occur are a form of infinit

2015-04-17 16:49:23 609

原创 leetcode Sudoku Solver

class Solution {public: int flip(int i){ int ret = 1 << i; ret = ~ret; return ret; } bool valid(int v, int x, int y, vector<int>&row, vector<int>&column, vector<int

2015-04-16 13:03:01 328

原创 leetcode Number of Islands

class Solution {public: const int dir[4][2] = {{-1,0},{1,0},{0,-1},{0,1}}; bool valid(int x, int y, int h, int w, vector<vector<char> >&grid){ return x >= 0 && x < h && y >= 0 && y < w

2015-04-16 11:26:51 347

原创 leetcode Restore IP Address

class Solution {public: inline int getlen(int digit){ return digit == 0 ? 1 : (((int)log10(digit)) + 1); } void dfs(const string& s, const int totlen, int index, int cur, int partn

2015-04-16 00:37:37 389

原创 leetcode Reverse Linked List

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *rev

2015-04-15 23:17:07 364

原创 db碎碎念

db中一个table的foreign key必须是另一个table的primary key么？如何使得两个table中主码互为对方的外码参考了https://social.msdn.microsoft.com/Forums/sqlserver/en-US/431c8ca9-5c4e-402b-8af0-cd58b71c2429/2-tables-referencing-each-other-u

2015-04-15 23:16:38 397

原创 leetcode partition list

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *par

2015-04-08 23:51:10 373

原创 leetcode Set Matrix Zero

class Solution {public: void setZeroes(vector<vector<int> > &matrix) { int h = matrix.size(); if(h == 0){ return; } int w = matrix[0].size(); if

2015-04-08 23:35:14 410

原创 leetcode Rotate List

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *rot

2015-04-08 21:48:16 335

原创 leetcode Sort Colors

class Solution {public: void sortColors(int A[], int n) { int cntZero = 0, cntTwo = 0; for(int i = 0; i < n; ++i){ cntZero += A[i] == 0 ? 1 : 0; cntTwo += A

2015-04-08 21:37:59 349

原创 leetcode Remove Duplicates From Sorted List

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *del

2015-04-08 21:20:16 334

原创 leetcode Insert Interval

/** * Definition for an interval. * struct Interval { * int start; * int end; * Interval() : start(0), end(0) {} * Interval(int s, int e) : start(s), end(e) {} * }; */class Sol

2015-04-08 21:00:48 325

原创 leetcode rotate image

class Solution {public: void rotate(vector<vector<int> > &matrix) { int n = matrix.size(); if(n < 2){ return; } int hl = 0, hr = n - 1, vu = 0, vd = n -

2015-04-08 19:52:45 320

原创 leetcode merge interval

/** * Definition for an interval. * struct Interval { * int start; * int end; * Interval() : start(0), end(0) {} * Interval(int s, int e) : start(s), end(e) {} * }; */class Sol

2015-04-08 18:12:07 406

原创 leetcode unique paths ii

class Solution {public: int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) { int h = obstacleGrid.size(); if(h == 0){ return 0; } int w =

2015-04-08 16:38:08 307

原创 leetcode word ladder bfs

先贴代码:class Solution {public: //void expand(queue<string>&sq, ) int ladderLength(string start, string end, unordered_set<string> &dict) { int slen = start.length(); int rlen = 0

2015-04-08 13:36:51 348

原创 poj 2352 树状数组

#include<iostream>#include<cstdio>#include<string.h>#include<cstring>#include<string>#include<algorithm>using namespace std;const int maxn = 15005;const int maxx = 32050;int ar[maxx], lev[maxn]

2015-04-08 00:38:11 365

原创 leetcode Binary Tree Level Order Traversal

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solutio

2015-04-01 19:56:07 329

原创 leetcode reverse words in a string

class Solution {public: void reverseWords(string &s) { int begin = 0, end = s.length() - 1; if(begin > end){ s = ""; return; } int pointer =

2015-04-01 19:48:38 379

baby的专栏