摘要：
selecta.namecolumnname,c.nameastypename,casewhena.is_nullable=0then'NotNull'else'Null'endasnullable,a.*fromsys.columnsa,sys.objectsb,sys.typescwherea.... 阅读全文
posted @ 2014-05-30 14:28
erictanghu
阅读(189)
评论(0)
推荐(0)
摘要：
原文:http://blog.csdn.net/tjvictor/article/details/4360030在SQL Server 中插入一条数据使用Insert语句，但是如果想要批量插入一堆数据的话，循环使用Insert不仅效率低，而且会导致SQL一系统性能问题。下面介绍SQL Server支... 阅读全文
posted @ 2014-05-30 14:23
erictanghu
阅读(210)
评论(0)
推荐(0)
摘要：
原文:http://www.cnblogs.com/dflying/archive/2006/04/17/377276.html本文翻译整理自Carlos Aguilar Mares的blog文章：Microsoft.Web.Administration in IIS 7。请注意本文的内容均基于Wi... 阅读全文
posted @ 2014-05-30 14:19
erictanghu
阅读(633)
评论(0)
推荐(0)
摘要：
原文:http://www.cnblogs.com/Aiooioo/archive/2011/05/30/cs-iis.html在.Net中我们可以使用内置的类DirectoryEntry来承载IIS服务器中的任何网站，虚拟路径或应用程序池对象，例如：DirectoryEntry ent = new... 阅读全文
posted @ 2014-05-30 14:18
erictanghu
阅读(844)
评论(0)
推荐(0)
摘要：
原文:http://www.knowsky.com/534237.htmlMicrosoft自WindowsVista一起发布了IIS 7.0，这个已经是去年的话题了，随后，由.NET开发的Web程序便逐步从IIS 6.0过渡到IIS 7.0上了。IIS 7.0提供了很多比上一版本更多的新特性，包括... 阅读全文
posted @ 2014-05-30 14:17
erictanghu
阅读(577)
评论(0)
推荐(0)
摘要：
原文:http://blog.sina.com.cn/s/blog_6a1837e901011167.htmlexeclp（从PATH 环境变量中查找文件并执行） 相关函数： fork，execl，execle，execv，execve，execvp 表头文件： #include ... 阅读全文
posted @ 2014-05-30 14:14
erictanghu
阅读(3119)
评论(0)
推荐(0)
摘要：
原文:http://www.cnblogs.com/hnrainll/archive/2011/07/23/2114854.html1、简介在Linux中，并不存在exec()函数，exec指的是一组函数，一共有6个，分别是：#include extern char **environ;int ex... 阅读全文
posted @ 2014-05-30 14:13
erictanghu
阅读(321)
评论(0)
推荐(0)
摘要：
原文:http://www.cnblogs.com/worfdream/articles/1956449.htmlJSON(JavaScript Object Notation) 是一种轻量级的数据交换格式，采用完全独立于语言的文本格式，是理想的数据交换格式。同时，JSON是 JavaScript ... 阅读全文
posted @ 2014-05-30 14:11
erictanghu
阅读(146)
评论(0)
推荐(0)
摘要：
C#端的WebService接口接收json格式数据，处理后以json格式返回resultusing System;using System.Collections.Generic;using System.Linq;using System.Web;using System.Web.Service... 阅读全文
posted @ 2014-05-30 14:09
erictanghu
阅读(226)
评论(0)
推荐(0)
摘要：
原文:http://www.cnblogs.com/milkmap/archive/2011/08/23/2150641.html摘要： “我有一堆标注，不规则的散落在地图的各个地方，我想把它们展示在一个最佳视野中，怎么办呢？”一位API爱好者咨询道。-----------------------... 阅读全文
posted @ 2014-05-30 14:02
erictanghu
阅读(320)
评论(0)
推荐(0)
摘要：
http://api.map.baidu.com/lbsapi/getpoint/index.html可以很方便的通过标记取得经纬度坐标也可以输入经纬度坐标获得地图标记 阅读全文
posted @ 2014-05-30 14:00
erictanghu
阅读(594)
评论(0)
推荐(0)
摘要：
思路是用加密程序 对硬盘号，cpu号和MAC号取出字符串并加密 产生一个序列号每次程序启动后重新产生这个序列号并比对，如果一致则验证通过using System;using System.Collections.Generic;using System.IO;using System.Managem... 阅读全文
posted @ 2014-05-30 13:56
erictanghu
阅读(1151)
评论(0)
推荐(0)
摘要：
要做一个视频无缝切换的程序，所谓无缝就是在一个视频结束时立即开始另一个视频，中间不要有切换的黑屏实现思路是放两个wmp播放控件，其中每个时刻只有一个在播放，另外一个处于暂停状态，并隐藏当一个视频播放完后，切换显示另一个视频，同时这个视频隐藏起来并加载下一段视频，视频加载完成后（wmp会有事件通知）暂... 阅读全文
posted @ 2014-05-30 13:52
erictanghu
阅读(3024)
评论(0)
推荐(0)
摘要：
1.基础类TransferFiles，client和server都需要using System;using System.Collections.Generic;using System.Text;using System.Net;using System.Net.Sockets;using Sys... 阅读全文
posted @ 2014-05-30 13:44
erictanghu
阅读(11158)
评论(2)
推荐(3)
摘要：
1.http://docs.seleniumhq.org/ 下载seleium包2.新建一个C#项目，比如控制台，引用seleium包中的dllusing System;using System.Collections.Generic;using System.Text;using OpenQA.S... 阅读全文
posted @ 2014-05-30 13:39
erictanghu
阅读(663)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(209)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(78)
评论(0)
推荐(0)
摘要：
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definiti... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(100)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(79)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(87)
评论(0)
推荐(0)
摘要：
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definitio... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(128)
评论(0)
推荐(0)
摘要：
Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * struct TreeNode { ... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(150)
评论(0)
推荐(0)
摘要：
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(130)
评论(0)
推荐(0)
摘要：
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for singly-linked list. ... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(131)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(208)
评论(0)
推荐(0)
摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2014-05-30 01:22
erictanghu
阅读(129)
评论(0)
推荐(0)
摘要：
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(104)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(97)
评论(0)
推荐(0)
摘要：
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(104)
评论(0)
推荐(0)
摘要：
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(185)
评论(0)
推荐(0)
摘要：
GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(87)
评论(0)
推荐(0)
摘要：
Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onlyO(... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(81)
评论(0)
推荐(0)
摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(140)
评论(0)
推荐(0)
摘要：
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(106)
评论(0)
推荐(0)
摘要：
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(107)
评论(0)
推荐(0)
摘要：
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(107)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2014-05-30 01:21
erictanghu
阅读(144)
评论(0)
推荐(0)
摘要：
There areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requi... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(246)
评论(0)
推荐(0)
摘要：
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(144)
评论(0)
推荐(0)
摘要：
Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniq... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(118)
评论(0)
推荐(0)
摘要：
Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded region... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(120)
评论(0)
推荐(0)
摘要：
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(102)
评论(0)
推荐(0)
摘要：
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest ... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(135)
评论(0)
推荐(0)
摘要：
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(96)
评论(0)
推荐(0)
摘要：
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(107)
评论(0)
推荐(0)
摘要：
Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(114)
评论(0)
推荐(0)
摘要：
Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(113)
评论(0)
推荐(0)
摘要：
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(91)
评论(0)
推荐(0)
摘要：
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-05-30 01:20
erictanghu
阅读(104)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(70)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3]./**... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(82)
评论(0)
推荐(0)
摘要：
Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(84)
评论(0)
推荐(0)
摘要：
Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(77)
评论(0)
推荐(0)
摘要：
There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(119)
评论(0)
推荐(0)
摘要：
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. *... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(65)
评论(0)
推荐(0)
摘要：
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(99)
评论(0)
推荐(0)
摘要：
Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(116)
评论(0)
推荐(0)
摘要：
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(200)
评论(0)
推荐(0)
摘要：
Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?/**... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(86)
评论(0)
推荐(0)
摘要：
Given a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For exam... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(96)
评论(0)
推荐(0)
摘要：
Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word.Return all such possibl... 阅读全文
posted @ 2014-05-30 01:19
erictanghu
阅读(135)
评论(0)
推荐(0)
摘要：
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Cl... 阅读全文
posted @ 2014-05-30 01:18
erictanghu
阅读(104)
评论(0)
推荐(0)
摘要：
Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2014-05-30 01:18
erictanghu
阅读(77)
评论(0)
推荐(0)
摘要：
Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line./** * Definition for a point. * struct Point { * ... 阅读全文
posted @ 2014-05-30 01:18
erictanghu
阅读(99)
评论(0)
推荐(0)
摘要：
Sort a linked list using insertion sort./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNo... 阅读全文
posted @ 2014-05-30 01:18
erictanghu
阅读(105)
评论(0)
推荐(0)
摘要：
Sort a linked list inO(nlogn) time using constant space complexity./** * Definition for singly-linked list. * struct ListNode { * int val; * L... 阅读全文
posted @ 2014-05-30 01:18
erictanghu
阅读(164)
评论(0)
推荐(0)
浙公网安备 33010602011771号