- 博客(193)
- 收藏
- 关注
RSS订阅转载 RAID磁盘阵列原理
磁盘阵列（Redundant Arrays of independent Disks，RAID），有“价格便宜具有冗余能力的磁盘阵列”之意。原理是利用数组方式来作磁盘组，配合数据分散排列的设计，提升数据的安全性。磁盘阵列是由很多价格较便宜的磁盘，组合成一个容量巨大的磁盘组，利用个别磁盘提供数据所产生加成效果提升整个磁盘系统效能。利用这项技术，将数据切割成许多区段，分别存放在各个硬盘上。磁...
2014-07-31 21:34:00
166
转载 javascript-Blob文件对象
一个Blob对象就是一个包含有只读原始数据的类文件对象.Blob对象中的数据并不一定得是JavaScript中的原生形式.File接口基于Blob,继承了Blob的功能,并且扩展支持了用户计算机上的本地文件.创建Blob对象的方法有几种,可以调用Blob构造函数,还可以使用一个已有Blob对象上的slice()方法切出另一个Blob对象,还可以调用canvas对象上的toBlob方法...
2014-07-31 21:19:00
156
转载 http 压缩
HTTP压缩是在Web服务器 和浏览器间传输压缩文本内容的方法。HTTP压缩采用通用的压缩算法如gzip等压缩HTML、JavaScript或 CSS文件。压缩的最大好处就是降低了网络传输的数据量，从而提高客户端浏览器的访问速度。当然，同时也会增加一点点服务器的负担。Gzip是比较常见的 一种HTTP压缩算法。1. 浏览器发送Http request 给Web服务器, reques...
2014-07-31 21:07:00
145
转载 动态规划思想：石子合并问题
描述：在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 贪心算法不能得到最优解，可惜了。首先我们可以把这么堆石子看成一列如果N－1次合并的全局最优解包含了每一次合并的子问题的最优解，那么经这样的N...
2014-07-21 09:51:00
254
转载 Sql Server根据表名获得所有列及其属性
selecta.namecolumnname,c.nameastypename,casewhena.is_nullable=0then'NotNull'else'Null'endasnullable,a.*fromsys.columnsa,sys.objectsb,sys.typescwherea.object_id=b.object_i...
2014-05-30 14:28:00
82
转载 IIS 7管理API——Microsoft.Web.Administration介绍
原文:http://www.cnblogs.com/dflying/archive/2006/04/17/377276.html本文翻译整理自Carlos Aguilar Mares的blog文章：Microsoft.Web.Administration in IIS 7。请注意本文的内容均基于Windows Vista Beta 2版本，在正式的发布版本中可能会有所改变。M...
2014-05-30 14:19:00
66
转载 C#使用DirectoryEntry操作IIS创建网站和虚拟路径
原文:http://www.cnblogs.com/Aiooioo/archive/2011/05/30/cs-iis.html在.Net中我们可以使用内置的类DirectoryEntry来承载IIS服务器中的任何网站，虚拟路径或应用程序池对象，例如：DirectoryEntry ent = newDirectoryEntry("IIS://localhost/w3svc...
2014-05-30 14:18:00
477
转载 C#管理IIS中的站点
原文:http://www.knowsky.com/534237.htmlMicrosoft自WindowsVista一起发布了IIS 7.0，这个已经是去年的话题了，随后，由.NET开发的Web程序便逐步从IIS 6.0过渡到IIS 7.0上了。IIS 7.0提供了很多比上一版本更多的新特性，包括完全模块化的组件、文本文件的配置功能、MMC图形模式管理工具等等，并且与.NET编程...
2014-05-30 14:17:00
154
转载 execlp函数使用
原文:http://blog.sina.com.cn/s/blog_6a1837e901011167.htmlexeclp（从PATH 环境变量中查找文件并执行） 相关函数： fork，execl，execle，execv，execve，execvp 表头文件： #include<unistd.h>...
2014-05-30 14:14:00
685
转载 Linux进程控制——exec函数族
原文:http://www.cnblogs.com/hnrainll/archive/2011/07/23/2114854.html1、简介在Linux中，并不存在exec()函数，exec指的是一组函数，一共有6个，分别是：#include <unistd.h>extern char **environ;int execl(const cha...
2014-05-30 14:13:00
77
转载 javascript操作json总结
原文:http://www.cnblogs.com/worfdream/articles/1956449.htmlJSON(JavaScript Object Notation) 是一种轻量级的数据交换格式，采用完全独立于语言的文本格式，是理想的数据交换格式。同时，JSON是 JavaScript 原生格式，这意味着在 JavaScript 中处理 JSON数据不须要任何特殊的 AP...
2014-05-30 14:11:00
56
转载 json的js和C#操作
C#端的WebService接口接收json格式数据，处理后以json格式返回resultusing System;using System.Collections.Generic;using System.Linq;using System.Web;using System.Web.Services;using Newtonsoft.Json.Linq;...
2014-05-30 14:09:00
62
转载 baidu地图让多个标注出现在最佳视野
原文:http://www.cnblogs.com/milkmap/archive/2011/08/23/2150641.html摘要： “我有一堆标注，不规则的散落在地图的各个地方，我想把它们展示在一个最佳视野中，怎么办呢？”一位API爱好者咨询道。--------------------------------------------------------------...
2014-05-30 14:02:00
143
转载 baidu地图的一个拾取坐标系统
http://api.map.baidu.com/lbsapi/getpoint/index.html可以很方便的通过标记取得经纬度坐标也可以输入经纬度坐标获得地图标记转载于:https://www.cnblogs.com/erictanghu/p/3760983.html...
2014-05-30 14:00:00
199
转载 C#实现防拷贝工具示例
思路是用加密程序 对硬盘号，cpu号和MAC号取出字符串并加密 产生一个序列号每次程序启动后重新产生这个序列号并比对，如果一致则验证通过using System;using System.Collections.Generic;using System.IO;using System.Management;using System.Text;using System.Ma...
2014-05-30 13:56:00
466
转载 C# Winform WindowsMediaPlayer控件
要做一个视频无缝切换的程序，所谓无缝就是在一个视频结束时立即开始另一个视频，中间不要有切换的黑屏实现思路是放两个wmp播放控件，其中每个时刻只有一个在播放，另外一个处于暂停状态，并隐藏当一个视频播放完后，切换显示另一个视频，同时这个视频隐藏起来并加载下一段视频，视频加载完成后（wmp会有事件通知）暂停这样就去除了加载时的短暂空挡有时可能会有键盘鼠标事件影响wmp的状态，所...
2014-05-30 13:52:00
274
转载 C# Socket传输大文件
1.基础类TransferFiles，client和server都需要using System;using System.Collections.Generic;using System.Text;using System.Net;using System.Net.Sockets;using System.Windows.Forms;names...
2014-05-30 13:44:00
329
转载 C#使用seleium实现一个自动登录器
1.http://docs.seleniumhq.org/ 下载seleium包2.新建一个C#项目，比如控制台，引用seleium包中的dllusing System;using System.Collections.Generic;using System.Text;using OpenQA.Selenium;using OpenQA.Selenium.I...
2014-05-30 13:39:00
110
转载 Symmetric Tree
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 / \ 2 2 / \ / \3 4 4 3But ...
2014-05-30 01:22:00
40
转载 Binary Tree Level Order Traversal
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,20,#,#,15,7}, 3 / \ 9 20 ...
2014-05-30 01:22:00
41
转载 Binary Tree Zigzag Level Order Traversal
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 alternate between).For example:Given binary...
2014-05-30 01:22:00
43
转载 Maximum Depth of Binary Tree
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 leaf node./** * Definition for binary t...
2014-05-30 01:22:00
45
转载 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./** * Definition for binary tree * struct TreeNod...
2014-05-30 01:22:00
38
转载 Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definition for binary tree * struct TreeNode...
2014-05-30 01:22:00
46
转载 Binary Tree Level Order Traversal II
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 example:Given binary tree{3,9,20,#,#,15,7},...
2014-05-30 01:22:00
56
转载 Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *le...
2014-05-30 01:22:00
53
转载 Minimum Depth of Binary Tree
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 leaf node./** * Definition for binary t...
2014-05-30 01:22:00
70
转载 Balanced Binary Tree
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 of the two subtrees ofeverynode never di...
2014-05-30 01:22:00
60
转载 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./** * Definition for singly-linked list. * struct ListNode { * int val;...
2014-05-30 01:22:00
65
转载 Pascal's Triangle
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]]class S...
2014-05-30 01:21:00
45
转载 Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right...
2014-05-30 01:21:00
36
转载 Pascal's Triangle II
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(k) extra space?class Solution ...
2014-05-30 01:21:00
41
转载 Populating Next Right Pointers in Each Node II
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 still work?Note:You may only use constant...
2014-05-30 01:21:00
54
转载 Triangle
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 following triangle[ [2], [3,4],...
2014-05-30 01:21:00
64
转载 Best Time to Buy and Sell Stock
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, buy one and sell one share of the stoc...
2014-05-30 01:21:00
36
转载 Best Time to Buy and Sell Stock II
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 as many transactions as you like (ie, buy...
2014-05-30 01:21:00
39
转载 Path Sum
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.For example:Given the below binary tree ands...
2014-05-30 01:21:00
40
转载 Path Sum II
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 = 22, 5 / \ ...
2014-05-30 01:21:00
47
转载 Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: ...
2014-05-30 01:21:00
42
转载 Distinct Subsequences
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 original string by deleting some (can be ...
2014-05-30 01:21:00
44
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人