2014年06月_VintNee

原创 undefined reference to symbol xx@@GLIBC_2.2.5

记一次编译出错的原因，不论如何添加

2014-06-30 15:47:44 21066 5

原创常用shell

namp -sP 192.168.1.0/24getconf LONG_BITsudo cpulimit -p pid -l 50:w !sudo tee > /dev/null %rename 'y/A-Z/a-z/' *　将当前的文件改成小写rename 'y/a-z/A-Z/' *tail -10000 access_log | awk '{print $1}' | sort |

2014-06-28 23:56:03 848

原创 find命令使用

find . -name .svn | xargs rm -rffind ~ -empty 大小为0的文件和目录find ~ -size +512M -maxdepth 4 -mindepth 3－10. find / -amin -10－11. find / -atime -2find ./ -mtime -1 -type f -exec ls -l {} \

2014-06-28 11:51:52 867

*vimtips.txt*VimTip 0: downloading Vim tips If you are reading this in a help window, then you have probably alreadyinstalled the "Tip of the Day" script, totd.vim . Congratulations! You cannow replac

2014-06-27 17:29:29 1025

原创 markdown在ubuntu上的使用

Markdown在ubuntu下的使用工具的使用安装的软件如下：sudo apt-get install retextretext Release-Notes.mdsudo apt-get install discountsudo apt-get install python-markdownsudo apt-get

2014-06-25 14:05:39 3864 1

原创实用shell命令

实用shellsudo !!python -m SimpleHTTPServer^foo^barctrl-x ecmdalt+. or Esc+.resetmount | column -tman asciicurl ifconfig.memount -t tmpfs tmpfs /mnt -o size=1024msshfs name@server:/path/to/f

2014-06-25 11:08:19 1038

原创 MarkDown模板

staticedit上的一个模板以后使用就方便

2014-06-25 02:16:37 2956

原创程序员在线实用工具箱

1. 一个在线的编辑txt流程图的地方，可用在txt中编辑，支持订

2014-06-25 01:50:32 1312

原创 leetcode-Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with

2014-06-22 16:59:34 919

原创 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:"((()))", "(()())", "(())()", "()(())", "()()

2014-06-22 02:48:53 853

原创 Leetcode-Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

2014-06-22 02:28:33 905

原创 leetcode-Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.

2014-06-21 23:43:07 997

原创 leetcode-Construct Binary Tree from Preorder and Inorder Traversal

Given preorder and inorder traversal of a tree, construct the binary tree.

2014-06-21 23:29:49 1116

原创 leetcode-Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th

2014-06-21 21:32:34 812

原创 Makefile模板

CXX = g++TARGET = bitmaploctestC_FLAGS += -g -WallLIB_FLAGS = -pthreadall: $(TARGET)bitmaploctest: bitmaploctest.o bitmaploc.o file_lock.o $(CXX) -o $@ $^ $(LIB_FLAGS) $(LIB) $(C_FLAGS).cpp.

2014-06-20 11:24:56 785

原创 valgrind－linux下检测内存工具

Valgrind 是一款 Linux下（支持 x86、x86_64和ppc32）程序的内存调试工具，它可以对编译后的二进制程序进行内存使用监测

2014-06-20 11:17:57 825

原创 linux下的编码命名

已知的几个命令：enca

2014-06-20 02:28:12 720

转载 shell整理

一个牛人的基本常识1.变量命名规则：首字符必须为字母中间不能有空格，可以有下划线_不能使用标点符号不能使用bash里的关键字2.变量赋值：变量名=值，（注意，= 两边不能有空格）var=1var=$var+1echo $var+1输出为1+1，而不是2可以用如下方法使其输出为2let "var+=1"#var=$[$var+1

2014-06-19 23:00:30 738

原创 Shell编程基础

１．　shell变量只能是字母加＿,必须以字母

2014-06-19 17:44:38 709

原创 lenovo future leaer deveolpmetn program

参加了一个实习生的招聘，题目不多，但时间不够，哎

2014-06-18 22:36:54 1120 4

转载求1+2＋．．．＋n

不用if.else.while等一切的条件判断这题真是

2014-06-18 17:02:45 824

原创 Linux下使用qq

qq的使用一直存在问题，真是考验人的耐性和windows上的体验不可同日而语，只能用webqq将

2014-06-15 01:57:37 967

原创编程之美１．８电梯调度

/* * ===================================================================================== * * Filename: 1-8.c * * Description: * * Version: 1.0 * Created: 2014年06月

2014-06-13 11:01:20 1194

原创 ubuntu小技巧

１．在Nautilus文件管理器中，右键添加“在终端中打开”

2014-06-12 18:44:32 743

转载 ubuntu给手机建wifi(14.04)测试成功

首先申明，这个是转载的，原文　http://blog.csdn.net/tiankonguse/article/details/29859667

2014-06-12 16:48:25 1241

原创 QuickSort快速排序

/* * ===================================================================================== * * Filename: QuickSort.c * * Description: * * Version: 1.0 * Created: 20

2014-06-11 22:19:53 716

原创查找二叉查找树的任意给定结点的“下一个”结点

#include #include using namespace std;const int maxn = 100;struct Node{ int key; Node *lchild, *rchild, *parent;};Node *p, node[maxn];int cnt;void init(){ p = NULL; memset(no

2014-06-10 08:56:19 984

原创图的深度搜索和广度搜索

#include #include #include #include using namespace std;const int maxn = 100;bool g[maxn][maxn], visited[maxn];int n;queue q;void init(){ memset(g, false, sizeof(g)); memset(visited

2014-06-09 23:57:21 900

原创单链表的环节点

１．判断单链表是否存在环２．　的

2014-06-09 21:31:24 1437

原创求两个链表结点组成的数之和

#include using namespace std;typedef struct node{ int data; node *next;}node;node* init(int a[], int n){ node *head=NULL, *p; for(int i=0; i<n; ++i){ node *nd = new node(

2014-06-09 20:32:15 1061

原创大整数乘法

#include#include#includechar result[200];void mulStr(char *str, char *one, char* two){ char *str1 = one; char *str2 = two; if(!strcmp(str1,"0")||!strcmp(str2,"0")) { strc

2014-06-06 17:23:52 1058

原创 leetcode-gas station

Gas Station Total Accepted: 12395 Total Submissions: 50855My SubmissionsThere are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car w

2014-06-06 10:57:35 835

原创 leetcode-3sumclosest

class Solution {public: int threeSumClosest(vector &num, int target) { int len = num.size(); sort(num.begin(),num.end()); int diff = INT_MAX; int result;

2014-06-05 09:15:19 809

原创 leetcode-3Sum

class Solution {public: vector > threeSum(vector &num) { vector>result; vectorvec; int len = num.size(); //assert(len<3); sort(num.begin(),num.end());

2014-06-05 08:59:12 749

原创 leetcode-Binary Tree Zigzag Level Order Traversa

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

2014-06-05 07:55:42 974

原创 leetcode-longest common prefix

class Solution {public: string longestCommonPrefix(vector &strs) { int size = strs.size(); if(size==0) return ""; if(size==1) return strs[

2014-06-04 15:04:14 857

原创 leetcode-String to Integer (atoi)

class Solution {public: int atoi(const char *str) { bool negative = false; while(*str==' ')str++ ; if(*str=='-') { negative = true;

2014-06-04 11:57:21 855

转载 2014薪水

关注官方微博关注官方微信添加到我的笔记下载有道云笔记2014年互联网IT待遇创建时间：2014-1-2 17:34 修改时间：2014-1-2 17:41 来源：http://blog.renren.com/share/331237347/16746027

2014-06-03 17:09:06 1067

空空如也

空空如也