- 博客(317)
- 资源 (5)
- 收藏
- 关注
原创 windows多线程没那么难
windows多线程没那么难作者:vpoetmail:18200268879@163.com上一博文中我们引入了CreateThread()多线程编程一个简单的例子,事实上我说windows多线程没那么难,那是为了安慰你,但是不要怕,困难时让人克服的。再大的困难也难不倒英雄的中国程序员。下面我又要介绍一个多线程的问题:我们首先看一个Demo,经典
2015-06-25 15:38:35 2307
原创 python局域网alive ip侦听
python局域网alive ip侦听作者:vpoet日期:夏季注:写着玩,欢迎copy# -*- coding: cp936 -*-# coding = utf-8import os import reimport threadimport timeimport socketimport sysdef Ping_Ip(Curr_Ip):
2015-06-24 12:51:51 3748 2
翻译 linux系统关于命令echo的15个例子
15 Practical Examples of ‘echo’ command in LinuxBy Avishek Kumar Under: Linux Commands On: August 21, 2014翻译 by SmallLiuecho命令是linux中的bash shell和C shell最常用的内建命令,最典型的是在脚
2014-11-25 18:59:52 3101
翻译 "usermod"命令使用完全指导---15个练习例程截图
"usermod"命令使用完全指导---15个练习例程截图By Babin Lonston Under: Linux Commands On: November 11, 2014翻译:By SmallLiu在Unix/Linux各个发行版,‘usermod’通过命令行常常用来修订和改变一个现存用户的任何属性.‘user
2014-11-24 19:53:36 3774
原创 MS-OFFICE2013之EXCEL神器-Power Map数据地图可视化范例
MS-OFFICE-2013之EXCEL神器-Power Map做数据地图可视化范例工具MS Office 2013 EXCEL+插件POWER MAPPOWER MAP是微软出品的一款面试的地图可视化EXCEL插件,该插件有强大的地图2D,3D展示功能。注意:office 2013以下的版本不支持POWER MAP一.安装及准备工作
2016-05-04 15:34:52 25947
原创 汇编语言学习第十四章-端口
本博文系列参考自>第三版,作者:王爽各种存储器都通过地址总线,数据总线以及控制总线与CPU相连。CPU对这些各种存储器组成的存储单元进行统一编址,统一寻址。除了各种存储器和CPU相连之外,还有以下几种芯片和CPU相连:(1)各种接口卡(比如网卡,显卡)上的芯片,它们控制接口卡工作 (2)主板上的接口芯片,CPU通过它们对部分外设进行访问 (
2016-05-03 13:29:04 4857
原创 汇编语言第十三章-int中断
本博文系列参考自>第三版,作者:王爽本博文将继续介绍另外一种内中断类型,int中断。13.1 int中断int指令格式为:int n,其中n为中断类型码。int n中断过程如下:取中断类型码n标志寄存器入栈,TF=0,IF=0CS,IP入栈(CS)=(n*4),(IP)=(n*4+2) 上面的代码段运行后将在屏幕中间显示一个’!’,然后再
2016-05-02 21:54:13 7712 1
转载 github上传时出现error: src refspec master does not match any解决办法
1 error:src refspec master does not match any这个问题,我之前也遇到过,这次又遇到了只是时间间隔比较长了,为了防止以后再遇到类似问题,还是把这个方法简单记录在此。当然,是通过搜索引擎找到的答案,开始用谷歌,我以为stackoverflow会很权威的,结果在这上面没有找到合适的。http://stackoverflow.com/question
2016-05-02 17:39:21 10829 2
原创 汇编语言学习第十二章-内中断
本博文系列参考自>第三版,作者:王爽当CPU执行完当前的任务的时候,收到来CPU外部或者内部发来的一种信息,转而不继续执行当前信息,而是立即对外部或者内部的信息进行处理,这样一种来自CPU外部或者内部的信息称为中断信息。中断的意思是指不再继续当前的任务执行下去,而是转而执行外部的或者内部的这个特殊信息。中断信息可以来自CPU内部或者CPU外部,即内中断或外中断。本文主要
2016-04-29 17:00:44 3842
原创 OpenCV2.4.10之samples_cpp_tutorial-code_learn-----ml(SVM支持向量机一)
本系列学习笔记参考自OpenCV2.4.10之opencv\sources\samples\cpp\tutorial_code和http://www.opencv.org.cn/opencvdoc/2.3.2/html/genindex.htmlSVM为支持向量机。它是一个分类器。简单说,SVM是通过我们一组训练样本来对平面进行一个最优的分割。i
2016-04-29 11:33:56 2092
原创 汇编语言学习第十一章-标志寄存器
本博文系列参考自>第三版,作者:王爽8086CPU的标志寄存器有16位,其中存储的信息通常被称为程序状态字(PSW)。除了前面介绍的寄存器。本博文将介绍最后一个寄存器,标志寄存器。不同于之前的寄存器,标志寄存器是按位起作用的。其每一位都有特殊的含义。8086标志寄存器的结构如下图所示:标志寄存器的1,3,5,12,13,14,15都没有特殊含义。其0,2,4
2016-04-28 13:44:29 2061
原创 OpenCV2.4.10之samples_cpp_tutorial-code_learn-----ImgTrans(Laplace边缘检测和Sobel边缘检测,图像重映射)
本系列学习笔记参考自OpenCV2.4.10之opencv\sources\samples\cpp\tutorial_code和http://www.opencv.org.cn/opencvdoc/2.3.2/html/genindex.html在图像处理中,往往需要对图像提取有效的边缘。本博文将介绍Laplace边缘检测和Sobel边缘检测。Demo源
2016-04-27 22:31:54 1353
原创 汇编语言学习第十章-CALL和RET指令
本博文系列参考自>第三版,作者:王爽call与ret都是转移指令,它们可以改变IP值,或者同时改变CS与IP的值,往往在程序中使用它们进行子程序模块的设计。10.1 ret和retfret用栈的数据修改IP的内容,实现近转移retf用栈中的数据修改CS与IP的内容,实现远转移ret执行步骤:(1):(IP)=((SS)*16+SP)(2
2016-04-27 21:58:08 31022 1
原创 OpenCV2.4.10之samples_cpp_tutorial-code_learn-----ImgTrans(Hough变换)
本系列学习笔记参考自OpenCV2.4.10之opencv\sources\samples\cpp\tutorial_code和http://www.opencv.org.cn/opencvdoc/2.3.2/html/genindex.html在图像中我们往往需要检测出一定形状的图形,比如圆等。霍夫变换就是用来检测图像中特定形状的变换,本文将介绍霍夫变换进行检测员和霍夫变
2016-04-26 21:57:30 4529
转载 操作系统典型调度算法
本文来自:http://c.biancheng.net/cpp/html/2595.html在操作系统中存在多种调度算法,其中有的调度算法适用于作业调度,有的调度算法适用于进程调度,有的调度算法两者都适用。下面介绍几种常用的调度算法。先来先服务(FCFS)调度算法FCFS调度算法是一种最简单的调度算法,该调度算法既可以用于作业调度也可以用于进程调度。在作业调度中,算法每次从后备作业队列
2016-04-26 20:55:35 818
原创 LeeCode(Database)-Customers Who Never Order
Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything.Table: Customers.+----+-------+| Id | Na
2016-04-26 20:52:52 499
原创 LeeCode(Database)-Duplicate Emails
Write a SQL query to find all duplicate emails in a table named Person.+----+---------+| Id | Email |+----+---------+| 1 | a@b.com || 2 | c@d.com || 3 | a@b.com |+----+---------+For
2016-04-26 20:52:02 529
原创 LeeCode(Database)-Employees Earning More Than Their Managers
The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id.+----+-------+--------+-----------+| Id | Name | Salary |
2016-04-26 20:51:08 514
原创 LeeCode(Database)-Combine Two Tables
Table: Person+-------------+---------+| Column Name | Type |+-------------+---------+| PersonId | int || FirstName | varchar || LastName | varchar |+-------------+---------+Per
2016-04-26 20:50:16 478
原创 LeeCode-Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe
2016-04-26 20:48:16 605
原创 LeeCode-Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo
2016-04-26 20:47:18 468
原创 LeeCode-Sqrt(x)Implement int sqrt(int x). Compute and return the square root of x.
Implement int sqrt(int x).Compute and return the square root of x.int mySqrt(int x) { if(x==1) return 1;/* for(int i=2;i<=x/2;i++) { if(x=i*i) {
2016-04-26 20:46:29 1401
原创 LeeCode-Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5/** * Definition
2016-04-26 20:44:58 482
原创 LeeCode-Pow(x, n)
Implement pow(x, n).double myPow(double x, int n) { if(n==0) return 1.0; if(n<0) return 1.0/pow(x,-n); return x*pow(x,n-1); }
2016-04-26 20:44:03 578
原创 汇编语言学习第九章-转移指令的原理
本博文系列参考自>第三版,作者:王爽可以修改IP寄存器的值,或者同时修改CS与IP的值的指令称为转移指令。转移指令的功能就是使得CPU执行内存中某段特定的指令或程序。8086CPU的转移行为分为如下几类;1.只改变IP值,称为段内转移。比如 jmp ax;段内转移又分为短转移和近转移。短转移IP的修改范围为-128~127,近转移IP的修改范围为-32768~32767.
2016-04-26 20:41:34 4797
原创 LeeCode-Insertion Sort List
Sort a linked list using insertion sort./** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* insertionSortList(
2016-04-25 19:04:08 370
原创 LeeCode-Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold a
2016-04-25 19:03:23 348
原创 LeeCode-Power of Two
Given an integer, write a function to determine if it is a power of two.bool isPowerOfTwo(int n){ if(n<=0) return false; if(n==1) return true; bool judge=false;
2016-04-25 19:02:08 350
原创 LeeCode-Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares
2016-04-25 19:01:21 394
原创 LeeCode-Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ],
2016-04-25 19:00:08 417
原创 LeeCode-Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.c
2016-04-25 18:59:15 370
原创 LeeCode-Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integer
2016-04-25 18:58:06 411
原创 LeeCode-Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y
2016-04-25 18:57:08 351
原创 LeeCode-Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.class Solution {public: int romanToInt(string s) { int length = s.length(
2016-04-25 18:56:15 373
原创 LeeCode-Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3./** * Definition for s
2016-04-25 18:55:21 401
原创 LeeCode-Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.int singleNumber(int* nums, int numsSize) { if(numsSize==1) return nums[0]; int
2016-04-25 18:53:43 365
原创 LeeCode-Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element
2016-04-25 18:52:50 350
原创 LeeCode-Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1/** * Definition for a binary tree node. * public class TreeNode { *
2016-04-25 18:51:44 344
百度地图二次开发汇总
2015-10-23
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人