发表于
2017-04-29 13:22:12
[原]C# https客户端获取证书的工具方法
发表于
2017-04-29 13:20:44
[原]SSL 链接安全协议的enum
在进行HTTPS连接时，需要指定SecurityProtocol。对于.NET 4.0的代码，需要强制转换。...
System.Net.ServicePointManager.SecurityProtocol = (SecurityProtocolType) 192 |
(SecurityProtocolType) 768 |
(SecurityProtocolType) 3072;
...在 .net 4.5以上的代码使用以下代码即可。System.Net.ServicePointManager.SecurityProtocol =
System.Net.SecurityProtocolType.Ssl3
| System.Net.SecurityProtocolType.Tls12
| SecurityProtocolType.Tls11
| SecurityProtocolType.Tls;
...继续阅读
(9)
发表于
2017-04-29 13:16:46
[原]ASP.Net MVC + Data Table 实现分页+排序
实现思路：使用datatable内置的分页，排序使用attribute+反射来控制需要排序和显示的字段以及顺序分离排序和显示逻辑若要添加搜索逻辑只需要传递搜索的字段到后端即可(js初始化时把"searching": false拿掉)。View :@using BCMS.BusinessLogic
@using BCMS.BusinessLogic.Models
@model List@Html.DisplayNameFor(model => model.First().PersNo)@Html.DisplayNameFor(model => model.First().Personnel_Name)@Html.DisplayNameFor(model => model.First().Position)@Html.DisplayNameFor(model => model.First().Interchange)Action@section scripts {@{
var columns = DataTableHelper.DisplayColumns();
}
$(document).ready(function () {
$('#tblData').dataTa
...继续阅读
(8)
发表于
2017-03-17 10:04:05
[原]Windows配置Scikit-learn 学习环境
安装Pythonhttps://www.python.org/downloads/安装NumPy：http://sourceforge.net/projects/numpy/files/NumPy/1.10.2/安装scipy：http://sourceforge.net/projects/scipy/files/scipy/0.16.1/注意对应正确的python版本。安装piphttps://pip.pypa.io/en/stable/installing/下载下来之后执行：python get-pip.py setup安装scikit-learn进入pip目录C:/python27/Scripts/。直接运行命令：pip install scikit-learn测试安装：pythonimport sklearn不应该看到任何错误。
...继续阅读
(37)
发表于
2017-03-17 10:00:06
[原]C# Volatile
发表于
2016-12-26 16:18:35
[原]LeetCode -- Assign Cookies
问题描述:Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.Note:You may assume the greed factor is always positive. You cannot assign more than one cookie to one child.Example 1:Input: [1,2,3]
...继续阅读
(14)
发表于
2016-12-26 16:17:11
[原]LeetCode -- Convert a Number to Hexadecimal
题目描述：Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase.The hexadecimal string must not contain extra leading 0s. If the number is zero, it is represented by a single zero character '0'; otherwise, the first character in the hexadecimal string will not be the zero character.The given number is guaranteed to fit within the range of a 32-bit signed integer.You must not use any method provided by the library which converts/formats the number to hex directly.Example 1:In
...继续阅读
(12)
发表于
2016-12-26 16:15:28
[原]IIS中 传递json配置数据最大长度
IIS中 传递json配置数据最大长度<system.web.extensions>
<scripting>
<webServices>
<jsonSerialization maxJsonLength="500000000"/>
</webServices>
</scripting>
</system.web.extensions>
...继续阅读
(16)
发表于
2016-11-24 22:22:39
[原]LeetCode -- Ransom Note
题目描述：Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.Each letter in the magazine string can only be used once in your ransom note.Note:You may assume that both strings contain only lowercase letters.canConstruct("a", "b") -> falsecanConstruct("aa", "ab") -> falsecanConstruct("aa", "aab") -> true就是输入两个字符串，判断ransom是否为magazine的子集。考查的是哈希表，hash[字符，出现次数
...继续阅读
(10)
发表于
2016-11-24 22:21:23
[原]LeetCode -- Coin chane
题目描述：You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.Example 1:coins = [1, 2, 5], amount = 11return 3 (11 = 5 + 5 + 1)Example 2:coins = [2], amount = 3return -1.Note:You may assume that you have an infinite number of each kind of coin.分析： 给定硬币数组和指定金额，返回能够换得指定金额所使用最少的硬币数。此题一开始看以为使用贪心，后来想想会遗漏情况，因为硬币可以重复使用。从回溯的角度来看有点多余，因为并没有要求列举出所有情况数，只是求最值。对于coins{1,2,5}假设amount为其中之一，只需要一枚硬币。从DP角度考
...继续阅读
(14)
发表于
2016-01-11 11:56:57
[原]Xamarin部署时遇到错误： Failure [INSTALL_FAILED_UPDATE_INCOMPATIBLE]
1 把adb命令添加到环境变量。ADB 的位置：C:\Users\USER\AppData\Local\Android\android-sdk\platform-tools2. 卸载包，运行（是apk名字，不带apk后缀）：adb uninstall com.companyname.xxx3. 使用xamarin studio或VS 重新deploy
...继续阅读
(126)
发表于
2015-10-31 10:45:11
[原]LeetCode -- Length of last word
题目描述：Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defined as a character sequence consists of non-space characters only.For example, Given s = "Hello World",return 5.在一个字符串中，统计最后一个单词的长度。1. 需要清空末尾字符串的空白字符2. 直接统计实现代码：public class Solution {
public int LengthOfLastWord(string s) {
s = s.TrimEnd();
var len = 0;
for(var i = s.Length - 1;i >=0; i--){
if(s[i] == ' '){
return len;
}
len++;
...继续阅读
(63)
发表于
2015-10-10 19:14:14
[原]LeetCode -- Single Number
题目描述：Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?在一个数列中找到没有重复的那一个。思路：哈希表统计次数实现代码：public class Solution {
public int SingleNumber(int[] nums) {
var hash = new Dictionary<int,int>();
for(var i = 0;i < nums.Length; i++){
if(!hash.ContainsKey(nums[i])){
hash.Add(nums[i],1);
}
else{
hash[nums[i]]++;
}
}
foreac
...继续阅读
(50)
发表于
2015-08-11 15:25:12
[原]LeetCode -- Flatten 二叉树
这个题目主要考察二叉树的先序遍历。1. 先序遍历2. 节点用队列存储3. 遍历队列，建立链表实现：public class Solution {
public void Flatten(TreeNode root)
{
if(root == null)
{
return;
}
Travel(root);
root = _nodes[0];
root.left = null;
root.right = null;
for(var i = 1;i < _nodes.Count; i++){
var l = _nodes[i];
l.left = null;
l.right = null;
root.right = l;
root = root.right;
}
}
private List_nodes = new List();
private void Travel(TreeNode root){
_nodes.Add(root);
if(root.left != null){
Travel(root.left);
}
if(root.right != null){
Travel(root.right);
}
}
}
...继续阅读
(30)
发表于
2015-06-25 11:44:53
[原]算法练习 -- DP C# 实现 全组合算法
const string splitor = "----";
void Main()
{
var r = Dp(new List(){"a","b","c","d","e","f","g"});
Console.WriteLine(r);
//print combosition count
var count = 0;
for(var i = 0 ;i < r.Count; i++){
var c = Regex.Matches(r[i], splitor).Count;
count += c + 1;
}
Console.WriteLine(string.Format("total : {0}",count));
}
//Dp[0] = "a[0],a[1],...a[n]"
//Dp[i] = Dp[i-1] cross with Dp[0]
static ListDp(Listarr){
if(arr == null || arr.Count == 0){
return new List();
}
var dpArr = new dynamic[arr.Count];
var t = string.Empty;
for(var i = 0;i < arr.Count - 1; i++){
t += arr[i] + ",";
}
t += ar
...继续阅读
(35)