- 博客(6)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 [leetcode] Isomorphic Strings
简单题，map记录下即可~代码如下：bool isIsomorphic(string s, string t) { if(s.length() != t.length()) return false; unordered_map mp1; unordered_map mp2; for(int i = 0;
2015-04-30 15:29:48
436
原创 [leetcode] Happy Number
简单题，模拟并记录即可~代码如下：bool isHappy(int n) { unordered_set appear; while(n != 1){ appear.insert(n); int tmp = n; n = 0; while(tmp){
2015-04-22 11:01:31
301
原创 [leetcode] Bitwise AND of Numbers Range
简单题，当m和n不相等时，即区间内必存在奇偶数，故低位AND后取0，故结果为m和n从高位开始取相等的那些位得到的值。代码如下：int rangeBitwiseAnd(int m, int n) { int p = 0; while(m != n && m != 0){ ++p; m >>= 1;
2015-04-20 21:47:14
352
原创 [leetcode] Number of Islands
BFS或DFS，利用grid数组来标记是否访问。代码如下：int numIslands(vector> &grid) { if(grid.empty()) return 0; const int m = grid.size(); const int n = grid[0].size(); int dir[4
2015-04-14 16:56:34
316
原创 [leetcode] Binary Tree Right Side View
dfs，记录已经访问到的层数即可。代码如下：vector rightSideView(TreeNode *root) { vector result; int curLevel = 0, level = -1; dfs(result, curLevel, level, root); return result; }
2015-04-07 22:09:32
383
原创 [leetcode] House Robber
简单题，代码如下：int rob(vector &num) { if(num.empty()) return 0; int pre = 0, cur = num[0]; int result = cur; for(int i = 1; i < num.size(); ++i){ re
2015-04-07 22:07:30
270
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人