Z-Pilgrim-优快云博客

通过get_variable（"v"）函数获取变量时，如果tf.variable_scope的reuse参数是True，如果v是已经被创建过了就直接返回，但是如果没有创建会报错。如果设置成False，变量v如果没有被创建过就直接创建，如果创建过就报错。AUTO_REUSE的好处就是实现：如果创建过就返回，没有创建过就创建一个新的变量返回AUTO_REUSE.__doc__ = ""...

2019-07-10 15:41:41 4437 3

原创 tf实现用二维的索引从二维数组获取对应值 tf.gather_nd

a = tf.constant([[1, 2, 3], [4, 5, 6], [7, 8, 9]])inds = tf.constant([[0, 2], [2, 1], [1, 1]])#目的是实现从[1,2,3]获取index为[0,2]的值也就是[1,3]作为第一行，从[4,5,6]获取index为[2,1]的值也就是[6,5]作为第二行, 从[7,8,9]获取index[1,...

2019-03-17 23:35:49 1670

原创 tf.nn.fixed_unigram_candidate_sampler解释

https://www.tensorflow.org/api_docs/python/tf/random/fixed_unigram_candidate_sampler上面链接是官网解释，看了一会儿感觉没看懂跑了几个列子有点懂了。本文结合https://www.w3cschool.cn/tensorflow_python/tf_nn_fixed_unigram_candidate_...

2019-03-13 18:05:03 4732

原创 ***Leetcode 894. All Possible Full Binary Trees

https://leetcode.com/problems/all-possible-full-binary-trees/description/ /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *ri...

2018-10-09 01:30:51 261

原创 *Leetcode 814. Binary Tree Pruning

https://leetcode.com/problems/binary-tree-pruning/description//** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * Tr...

2018-10-07 12:41:20 210

原创 **Leetcode 701. Insert into a Binary Search Tree

https://leetcode.com/problems/insert-into-a-binary-search-tree/description/想清楚很好写。。/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * Tre...

2018-10-07 02:51:11 290

原创 **Leetcode 450. Delete Node in a BST

https://leetcode.com/problems/delete-node-in-a-bst/description/不错的题有一些细节需要注意 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNo...

2018-10-07 01:36:08 142

原创 Leetcode 404. Sum of Left Leaves

https://leetcode.com/problems/sum-of-left-leaves/description/ /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * ...

2018-10-06 01:29:46 140

原创 ***Leetcode 881. Boats to Save People

https://leetcode.com/problems/boats-to-save-people/description/ 赤裸裸的双指针的题，，竟然没看出来。。。class Solution {public: int numRescueBoats(vector<int>& people, int limit) { sort(peop...

2018-10-06 01:09:56 323

原创 *Leetcode 874. Walking Robot Simulation

https://leetcode.com/problems/walking-robot-simulation/description/因为X<= 9 所以一步一步枚举就行。。 class Solution {public: string hash(int x, int y) { return to_string(x) + "->" + to...

2018-10-05 23:50:43 201

原创 ***Leetcode 767. Reorganize String

https://leetcode.com/problems/reorganize-string/description/套路题了如果是判断是否可行，判断条件就是最多的不能超过总长度的一半（考虑计数情况）如果是找方案就需要优先队列了。。 struct cmp { bool operator()(const pair<int, int> & a, c...

2018-10-05 22:19:01 252

原创 *Leetcode 763. Partition Labels

https://leetcode.com/problems/partition-labels/description/const int SIZE = 256;class Solution {public: bool judge( int cnt[], int hash[] ) { // bool ret = true; for (int...

2018-10-05 18:32:43 225

原创 Leetcode 455. Assign Cookies

https://leetcode.com/problems/assign-cookies/description/bool cmp(const int a, const int b) { return a < b;}class Solution {public: int findContentChildren(vector<int>& g,...

2018-10-05 18:19:13 142

原创 ***Leetcode 435. Non-overlapping Intervals

https://leetcode.com/problems/non-overlapping-intervals/description/很不错的题跟课程规划那个题有点相似bool cmp( const Interval& a , const Interval& b ) { if (a.start != b.start) return a.start < b...

2018-10-05 17:52:47 132

原创 *Leetcode 738. Monotone Increasing Digits

https://leetcode.com/problems/monotone-increasing-digits/description/ 这个难度的还是比较容易想的，找到最左边不合法的位置后面都设置成9即可需要从右向左找因为有 3312这种case,第二个3更新之后第一个3一样要更新。。class Solution {public: int monoton...

2018-10-05 16:46:55 269

原创 **Leetcode 659. Split Array into Consecutive Subsequences

https://leetcode.com/problems/split-array-into-consecutive-subsequences/description/这个代码技巧性太强了参考了http://www.cnblogs.com/grandyang/p/7525821.html基本思路就是，up维护数可能存在次数的上限，class Solution {public:...

2018-10-05 16:04:54 302

原创 ***Leetcode 316. Remove Duplicate Letters

https://leetcode.com/problems/remove-duplicate-letters/description/ 不是很容易想。如果来了一个新的字母就考虑放在哪个位置合适，之前已经选的字母如果后面还有，就可以暂时删除。 class Solution {public: string removeDuplicateLetters(string ...

2018-10-05 02:11:45 162

原创 *Leetcode 67. Add Binary

https://leetcode.com/problems/add-binary/description/ 手算大数减价乘除如何更简洁代码的问题。。class Solution {public: string addBinary(string a, string b) { int i = a.size() - 1, j = b.size() - 1; ...

2018-10-03 22:53:03 139

原创 ***Leetcode 376. Wiggle Subsequence

https://leetcode.com/problems/wiggle-subsequence/description/ class Solution {public: vector<int> filter(vector<int>& nums) { vector<int> ret; for ...

2018-09-29 01:29:34 141

演示数据结构的算法过程

空空如也