07 2014 档案

LeetCode Reverse Nodes in k-Group
摘要：class Solution {public: ListNode *reverseKGroup(ListNode *head, int k) { if (k next = rhead; } last = rtail; } ... 阅读全文
posted @ 2014-07-27 23:18 卖程序的小歪 阅读(225) 评论(0) 推荐(0) 编辑
LeetCode Unique Binary Search Trees II
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2014-07-27 21:59 卖程序的小歪 阅读(183) 评论(0) 推荐(0) 编辑
Binary Tree Zigzag Level Order Traversal
摘要：Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ... 阅读全文
posted @ 2014-07-27 13:26 卖程序的小歪 阅读(162) 评论(0) 推荐(0) 编辑
LeetCode Anagrams
摘要：struct mystat { int idx; int cnt[26]; mystat(int id = 0) {idx = id;}};bool cmp(const mystat &a, const mystat &b) { for (int i=0; i b.cnt[i... 阅读全文
posted @ 2014-07-27 12:42 卖程序的小歪 阅读(110) 评论(0) 推荐(0) 编辑
LeetCode Wildcard Matching
摘要：class Solution {public: bool isMatch(const char *s, const char *p) { if (s == NULL || p == NULL) return false; int slen = 0; i... 阅读全文
posted @ 2014-07-26 23:43 卖程序的小歪 阅读(217) 评论(0) 推荐(0) 编辑
MySQL 重装
摘要：最近一台服务器上的MySQL崩了，innodb单单靠.frm和.ibd好像恢复不过来，只能重装。但是重装也没让人省心，最好把/var/lib/mysql和/etc/mysql都删了，如果提示mysql-server-core要autoremove 的就在执行一次apt-get autoremove才... 阅读全文
posted @ 2014-07-24 10:41 卖程序的小歪 阅读(150) 评论(0) 推荐(0) 编辑
MySQL root 密码修改
摘要：小伙伴要在以前的服务器上装个代码版本控制的软件，要用到数据库，可是想来找去root密码还是忘了，其他已经安装的服务都是用的专用账户配置文件里要找不到root用户的密码。用以下方法将密码强制修改掉：1. 将mysql服务以安全模式方式运行，需要系统root权限sudo suservice mysql ... 阅读全文
posted @ 2014-07-23 14:30 卖程序的小歪 阅读(198) 评论(0) 推荐(0) 编辑
LeetCode Clone Graph
摘要：class Solution {public: UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) { UndirectedGraphNode *clone = dfs(node); dfs_clea... 阅读全文
posted @ 2014-07-22 20:29 卖程序的小歪 阅读(177) 评论(0) 推荐(0) 编辑
LeetCode Best Time to Buy and Sell Stock III
摘要：class Solution {public: int maxProfit(vector &prices) { int len = prices.size(); if (len i2r(len, 0); vector i2l(len, 0); ... 阅读全文
posted @ 2014-07-22 16:09 卖程序的小歪 阅读(161) 评论(0) 推荐(0) 编辑
LeetCode Evaluate Reverse Polish Notation
摘要：Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2014-07-22 10:56 卖程序的小歪 阅读(137) 评论(0) 推荐(0) 编辑
LeetCode First Missing Positive
摘要：class Solution {public: int firstMissingPositive(int A[], int n) { if (A == NULL || n bits(len, false); for (int i=0; i n) continue;... 阅读全文
posted @ 2014-07-21 21:09 卖程序的小歪 阅读(161) 评论(0) 推荐(0) 编辑
LeetCode Roman to Integer
摘要：class Solution {private: const static char* pattern[]; const static char* roman[]; unordered_map a2i;public: int romanToInt(string s) { ... 阅读全文
posted @ 2014-07-20 20:32 卖程序的小歪 阅读(119) 评论(0) 推荐(0) 编辑
LeetCode Trapping Rain Water
摘要：class Solution {public: int trap(int A[], int n) { if (n peaks; vector peaks_tmp; int last_idx = 0; bool increasing = ... 阅读全文
posted @ 2014-07-20 17:27 卖程序的小歪 阅读(227) 评论(0) 推荐(0) 编辑
LeetCode Subsets II
摘要：class Solution {public: vector > subsetsWithDup(vector &S) { int len = S.size(); vector > res; vector subset; if (len ... 阅读全文
posted @ 2014-07-19 09:03 卖程序的小歪 阅读(146) 评论(0) 推荐(0) 编辑
LeetCode Rotate Image
摘要：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?class Solution {pub... 阅读全文
posted @ 2014-07-19 00:52 卖程序的小歪 阅读(152) 评论(0) 推荐(0) 编辑
LeetCode Palidrome Number
摘要：class Solution {public: bool isPalindrome(int x) { if (x =0; i--) { int a = n / tens; int b = n % 10; n = n... 阅读全文
posted @ 2014-07-18 23:38 卖程序的小歪 阅读(230) 评论(0) 推荐(0) 编辑
LeetCode Generate Parentheses
摘要：class Solution {public: vector generateParenthesis(int n) { string str; vector res; dfs(n, 0, 0, str, res); return res;... 阅读全文
posted @ 2014-07-18 18:46 卖程序的小歪 阅读(160) 评论(0) 推荐(0) 编辑
LeetCode Maximum Subarray
摘要：class Solution {public: int maxSubArray(int A[], int n) { int cur_sum = 0; int max_sum = INT_MIN; for (int i=0; i max_... 阅读全文
posted @ 2014-07-18 18:40 卖程序的小歪 阅读(144) 评论(0) 推荐(0) 编辑
LeetCode Set Matrix Zeroes
摘要：class Solution {public: void setZeroes(vector > &matrix) { int rows = matrix.size(); int cols = matrix[0].size(); bool... 阅读全文
posted @ 2014-07-18 15:52 卖程序的小歪 阅读(139) 评论(0) 推荐(0) 编辑
LeetCode Remove Nth Node From End of List
摘要：class Solution {public: ListNode *removeNthFromEnd(ListNode *head, int n) { if (head == NULL) return NULL; ListNode* pre = NULL; ... 阅读全文
posted @ 2014-07-18 14:36 卖程序的小歪 阅读(163) 评论(0) 推荐(0) 编辑
Linux Loop设备 使用
摘要：有时候需要一个独立的块设备，loop设备是个方便的选择，可通过如下方式创建dd if=/dev/zero of=./loopback_file bs=1M count=1000losetup /dev/loop0 ./loopback_file首先建立一个指定大小的文件作为实际存储的空间，然后将其与... 阅读全文
posted @ 2014-07-18 00:45 卖程序的小歪 阅读(1006) 评论(0) 推荐(0) 编辑
Linux 文件系统大小调整
摘要：有些使用需要进行文件系统的大小调整，比如使用LVM，或者在loopback设备上建立文件系统等，但该文件系统不是根文件系统时可以通过一下步骤，简单的进行：e2fsck -f /dev/loop0resize2fs /dev/loop0 900M这里使用的块设备为/dev/loop0,调整大小为900... 阅读全文
posted @ 2014-07-17 23:02 卖程序的小歪 阅读(830) 评论(0) 推荐(0) 编辑
LeetCode N-Queens II
摘要：class Solution {private: int queen_num; int total;public: int totalNQueens(int n) { queen_num = n; total = 0; vector h(n... 阅读全文
posted @ 2014-07-17 19:53 卖程序的小歪 阅读(161) 评论(0) 推荐(0) 编辑
LeetCode Sort Colors
摘要：class Solution {public: void sortColors(int A[], int n) { int cnt[3] = {0}; for (int i = 0; i 0) start += cnt[i-1]; for (... 阅读全文
posted @ 2014-07-17 19:43 卖程序的小歪 阅读(138) 评论(0) 推荐(0) 编辑
LeetCode Jump Game II
摘要：class Solution {private: vector sum; vector step; set can;public: int jump(int A[], int n) { step.clear(), sum.clear(), can.clear()... 阅读全文
posted @ 2014-07-17 16:08 卖程序的小歪 阅读(199) 评论(0) 推荐(0) 编辑
LeetCode Jump Game
摘要：class Solution {public: bool canJump(int A[], int n) { if (A == NULL || n sum(n, 0); int jump = A[n-1]; for (int i=n-... 阅读全文
posted @ 2014-07-16 16:38 卖程序的小歪 阅读(239) 评论(0) 推荐(0) 编辑
LeetCode N-Queens
摘要：class Solution {private: int queen_num; vector > res;public: vector > solveNQueens(int n) { res.clear(); queen_num = n; ... 阅读全文
posted @ 2014-07-16 10:13 卖程序的小歪 阅读(156) 评论(0) 推荐(0) 编辑
LeetCode Count and Say
摘要：class Solution {public: string countAndSay(int n) { vector num; num2digit(1, num); vector tmp; for (int i = 1; i &digit... 阅读全文
posted @ 2014-07-16 09:12 卖程序的小歪 阅读(152) 评论(0) 推荐(0) 编辑
LeetCode Construct Binary Tree from Inorder and Postorder Traversal
摘要：class Solution {public: TreeNode *buildTree(vector &inorder, vector &postorder) { int ilen = inorder.size(); int plen = postorder.siz... 阅读全文
posted @ 2014-07-15 18:13 卖程序的小歪 阅读(178) 评论(0) 推荐(0) 编辑
LeetCode Construct Binary Tree from Preorder and Inorder Traversal
摘要：class Solution {public: TreeNode *buildTree(vector &preorder, vector &inorder) { int plen = preorder.size(); int ilen = inorder.size(... 阅读全文
posted @ 2014-07-15 16:25 卖程序的小歪 阅读(137) 评论(0) 推荐(0) 编辑
LeetCode Convert Sorted List to Binary Search Tree
摘要：/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *... 阅读全文
posted @ 2014-07-15 10:38 卖程序的小歪 阅读(151) 评论(0) 推荐(0) 编辑
LeetCode Convert Sorted Array to Binary Search Tree
摘要：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文
posted @ 2014-07-15 10:11 卖程序的小歪 阅读(130) 评论(0) 推荐(0) 编辑
LeetCode Restore IP Addresses
摘要：class Solution {public: vector restoreIpAddresses(string s) { vector ips; vector ip; dfs(s, 0, ip, ips); return ips; ... 阅读全文
posted @ 2014-07-05 08:55 卖程序的小歪 阅读(167) 评论(0) 推荐(0) 编辑
LeetCode Plus One
摘要：class Solution {public: vector plusOne(vector &digits) { int carry = 1; int len = digits.size(); vector res; ... 阅读全文
posted @ 2014-07-04 23:41 卖程序的小歪 阅读(234) 评论(0) 推荐(0) 编辑