摘要: 官网github地址:https://github.com/tf-coreml/tf-coreml 我是先是用这条命令安装好了好久 遇到很多问题,最后在numpy版本号冲突结束了,又不想乱卸载,所以我接着试着源码安装。 Install From Source To build and install 阅读全文
posted @ 2018-04-14 12:16 Hwangzhiyoung 阅读(726) 评论(0) 推荐(0) 编辑
摘要: 一、c++中模板是什么? 首先: 通常我们想要比较不同数据类型的时候不得不定义两种不同的函数来表示区分,为了能精简代码和避免强类型的严格性和灵活性的冲突,我们就需要用到模板去改善这种情况。 二、为什么要定义模板? 强类型程序设计中,参与运算的所有对象的类型在编译时即确定下来,并且编译程序将进行严格的 阅读全文
posted @ 2018-04-09 13:19 Hwangzhiyoung 阅读(6472) 评论(0) 推荐(0) 编辑
摘要: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2018-04-07 16:30 Hwangzhiyoung 阅读(140) 评论(0) 推荐(0) 编辑
摘要: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2018-04-07 16:27 Hwangzhiyoung 阅读(165) 评论(0) 推荐(0) 编辑
摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2018-04-07 16:22 Hwangzhiyoung 阅读(159) 评论(0) 推荐(0) 编辑
摘要: Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th 阅读全文
posted @ 2018-04-07 16:16 Hwangzhiyoung 阅读(184) 评论(0) 推荐(0) 编辑
摘要: Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
posted @ 2018-04-07 16:08 Hwangzhiyoung 阅读(200) 评论(0) 推荐(0) 编辑
摘要: Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
posted @ 2018-04-07 15:59 Hwangzhiyoung 阅读(281) 评论(0) 推荐(0) 编辑
摘要: 环境:Python 3.6.4 |Anaconda, Inc. Python常用容器类型 1.list 2.tuple <class 'tuple'> 遍历list(for循环): 1 a 2 b 遍历tuple(while循环): 1 a 2 b <class 'tuple'> 遍历list(fo 阅读全文
posted @ 2018-04-06 21:05 Hwangzhiyoung 阅读(369) 评论(0) 推荐(0) 编辑
摘要: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 题目意思:k个有序链表合并后仍为一个有序链表 解题思路:我先将链表存储在vector中,然后我用新的v 阅读全文
posted @ 2018-03-24 22:41 Hwangzhiyoung 阅读(233) 评论(0) 推荐(0) 编辑