码迷,mamicode.com
首页 >  
搜索关键字:convert    ( 4765个结果
集合类转化成数组
列表转化成数组,ArrayList convert to Array
分类:其他好文   时间:2014-08-18 21:42:32    阅读次数:209
编程之美leetcode之编辑距离
Edit Distance   Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operati...
分类:其他好文   时间:2014-08-18 20:35:02    阅读次数:206
随机日期
DateTime dateTimeMin = Convert.ToDateTime("2014-01-01"); DateTime dateTimeMax = Convert.ToDateTime(System.DateTime.Now ); TimeSpan ts = new...
分类:其他好文   时间:2014-08-18 20:09:52    阅读次数:245
Edit Distance || 计算字符串相似度
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)...
分类:其他好文   时间:2014-08-18 16:21:57    阅读次数:148
维护数字字典时,批量导入数据库的列注释、类型等相关信息
导出的格式形如:use ppdai_vd;goSELECT 'ppdai_vd' AS 数据库名, a.name as '表名' , isnull(e.value,'') as '表注释', CONVERT(VARCHAR(19), a.create_date ,23) AS '...
分类:数据库   时间:2014-08-18 14:15:42    阅读次数:222
CAST和CONVERT差别与联系
CAST和CONVERT:都是将一种数据类型转换成为另一种数据类型。CAST:CAST ( expression AS data_type [ ( length ) ] )EG: CAST(ListPrice AS varchar(12))cast(Round(SalesYTD / commissi...
分类:其他好文   时间:2014-08-18 12:21:24    阅读次数:159
[LeetCode] Edit Distance(很好的DP)
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have t...
分类:其他好文   时间:2014-08-18 12:20:34    阅读次数:148
C# 使用int.TryParse,Convert.ToInt32,(int)将浮点类型转换整数时的区别
int.TryParse,Convert.ToInt32,(int)这几种类型在将浮点类型转换整数时是有差别Convert.ToInt32则会进行四舍五入int.TryParse只能转换整数,即浮点类型全部会返回0(int)不会进行四舍五入,只取整数部分,小数点部分完全舍弃usingSystem;p...
分类:其他好文   时间:2014-08-18 12:08:54    阅读次数:414
LeetCode ZigZag Conversion
class Solution {public: string convert(string s, int nRows) { int len = s.length(); if (len cols; int si = 0; int ri =...
分类:其他好文   时间:2014-08-17 21:21:32    阅读次数:218
Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.思路:取数组的中点为树的根,前半部分为左子树,后半部分为右子树。 1 class Solution { 2...
分类:其他好文   时间:2014-08-17 13:02:12    阅读次数:210
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!