Fork me on GitHub
上一页 1 2 3 4 5 6 7 8 ··· 37 下一页
摘要: 最近需要一批汉字字符数据,类似数字字符与ASCII码之间的对应关系,汉字字符与Unicode码之间也存在对应关系。 所以可以遍历Unicode码批量生成汉字。 其中,汉字为宽字符,输出时候注意需要修改成wcout wofstream ,还有使用imbue函数修改区域语言对象,改成chs中文。 效果如 阅读全文
posted @ 2018-07-31 17:27 hellowOOOrld 阅读(480) 评论(0) 推荐(0) 编辑
摘要: 最近需要用到根据图片URL批量下载到本地的操作。查找了相关资料,记录在这儿。 1.首先在CSV文件中提取出url 2.根据URL将图片保存到本地。 需要用到 URLDownloadToFile函数 。 踩的坑主要是 这个函数需要用到宽字符参数。。如果参数类型不正确。。那么你甭想下载得到正确文件。。。 阅读全文
posted @ 2018-05-07 21:26 hellowOOOrld 阅读(1505) 评论(0) 推荐(0) 编辑
摘要: A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com 阅读全文
posted @ 2018-04-14 23:37 hellowOOOrld 阅读(427) 评论(0) 推荐(0) 编辑
摘要: You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points. Notes: 3 <= points.length < 阅读全文
posted @ 2018-04-13 16:27 hellowOOOrld 阅读(410) 评论(0) 推荐(0) 编辑
摘要: Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible stri 阅读全文
posted @ 2018-03-03 20:48 hellowOOOrld 阅读(407) 评论(0) 推荐(0) 编辑
摘要: S and T are strings composed of lowercase letters. In S, no letter occurs more than once. S was sorted in some custom order previously. We want to per 阅读全文
posted @ 2018-02-26 19:37 hellowOOOrld 阅读(387) 评论(0) 推荐(0) 编辑
摘要: X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. A number is valid if each 阅读全文
posted @ 2018-02-26 17:08 hellowOOOrld 阅读(331) 评论(0) 推荐(0) 编辑
摘要: Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Exa 阅读全文
posted @ 2018-02-12 20:03 hellowOOOrld 阅读(484) 评论(0) 推荐(0) 编辑
摘要: We have some permutation A of [0, 1, ..., N - 1], where N is the length of A. The number of (global) inversions is the number of i < j with 0 <= i < j 阅读全文
posted @ 2018-02-10 17:53 hellowOOOrld 阅读(491) 评论(0) 推荐(0) 编辑
摘要: On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each occurrence 阅读全文
posted @ 2018-02-10 02:04 hellowOOOrld 阅读(378) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 37 下一页