原创 高併發下的Java數據結構(List、Set、Map、Queue)
原文鏈接:https://www.cnblogs.com/yueshutong/p/9696216.html 來源 由於並行程序與串行程序的不同特點,適用於串行程序的一些數據結構可能無法直接
原创 LeetCode : 39. Combination Sum 組合求和
試題 Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique
原创 LeetCode : 232. Implement Queue using Stacks 棧實現隊列
試題 Implement the following operations of a queue using stacks. push(x) – Push element x to the back of queue. pop()
原创 稀疏矩陣的存儲及乘法實現
未完全測試,整體思路如下: import java.util.*; public class Main{ public static void main(String[] args){ Matrix a
原创 LeetCode : 225. Implement Stack using Queues隊列實現棧
試題 Implement the following operations of a stack using queues. push(x) – Push element x onto stack. pop() – Removes
原创 LeetCode : 133. Clone Graph克隆圖
試題 Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node
原创 LeetCode : 134. Gas Station加油
試題 There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car
原创 LeetCode : 662. Maximum Width of Binary Tree 最大二叉樹寬度
試題: Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the ma
原创 LeetCode : 120. Triangle三角形最短路徑
試題: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on t
原创 tf.image.convert_image_dtype 注意
image: 3-D Tensor of image. If dtype is tf.float32 then the range should be [0, 1], otherwise it would converted to
原创 tensorflow 性能優化
原文鏈接:https://blog.csdn.net/qq_16234613 環境變量TF_GPU_THREAD_MODE lantency收益:當 TF_GPU_THREAD_MODE
原创 tensorflow serving 編譯 運行
由於自己編譯,版本很重要。package下載出錯時,多運行幾遍。 bazel安裝: bazel 0.16.1 bash bazel-0.16.1-installer-linux-x86_64.sh export PATH="$PA
原创 tensorflow不知代碼情況下獲取graph的placeholder和output
Here is my way to find out the correct placeholder op name in the Graphdef part of the .meta file: saver = tf.train
原创 KDD Cup 2019 The 5th AutoML Challenge 開源
KddCup Rank List The top-10 teams of the competition (and the github URL to their solutions) are: Rank Team Name gi
原创 【動態規劃】最長公共子序列與最長公共子串
來源 1. 問題描述 子串應該比較好理解,至於什麼是子序列,這裏給出一個例子:有兩個母串 cnblogs belong 比如序列bo, bg, lg在母串cnblogs與belong中都出現過並且出現順序與母串保持一致,我們將其稱爲公共子