題目 As an emergency rescue team leader of a city, you are given a special map of your co...
發(fā)簡信
IP屬地：廣東
-
PAT1003 Emergency （25）(Dijkstra算法)
-
Visual Question Answering: A Survey of Methods and Datasets
VQA： Given an image and a question in natural language, it requires reasoning over visu...
-
深度學(xué)習(xí)在SR應(yīng)用論文總結(jié)Image Super-Resolution Using Deep Convolutional Networks （SRCNN ） 想法來源模擬稀疏編碼（sparse cod...
-
主流手機(jī)對(duì)比
參數(shù)對(duì)比： 數(shù)據(jù)來源：中關(guān)村在線華為官網(wǎng)以上數(shù)據(jù)不一定準(zhǔn)確（主要是價(jià)錢和存儲(chǔ)，其余應(yīng)該不會(huì)有太大變化，以實(shí)際購買時(shí)候?yàn)闇?zhǔn)，具體可以在京東商城查看。而且中關(guān)村測評(píng)會(huì)出的相對(duì)晚一...
-
ccf 201809-3 元素選擇器代碼 總結(jié) 這是一道考試時(shí)候沒寫出來的題目，有點(diǎn)難過。 屬于模擬題，主要是考查了字符串的匹配、截取的一些操作，熟悉 find, rfind, stringstream, su...
-
Device-to-Device Communication in 5G Cellular Networks: Challenges, Solutions, and Future Direct...vocabulary Abstract Conventional cellular systemdevices are not allowed to directly com...
-
PAT1079 Total Sales of Supply Chain (25)（dfs,樹的遍歷）
題目 A supply chain is a network of retailers（零售商）, distributors（經(jīng)銷商）, and suppliers（供應(yīng)商）...
-
PAT1053 Path of Equal Weight (30) (樹的遍歷)題目 Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti...
-
PAT1043 Is It a Binary Search Tree （25）（二叉查找樹BST）
類型 二叉搜索樹, 先序后序轉(zhuǎn)換 題目 A Binary Search Tree (BST) is recursively defined as a binary tree ...
-
SaGAN:Generative Adversarial Network with Spatial Attention for Face Attribute EditingProblem Traditional GAN methods directly operate on the whole image, and inevitably cha...
-
代碼整潔之道：有意義的命名
名副其實(shí) 如果名稱需要注釋來補(bǔ)充，那就不是名副其實(shí) bad good 避免誤導(dǎo) 別留下掩藏代碼本意的錯(cuò)誤線索 badaccoutList除非它真的是List類型 goodac...
-
StarGAN: Unified Generative Adversarial Networks for Multi-Domain Image-to-Image TranslationProblem existing models are both inefficient and ineffective in such multi-domain image...
-
PAT1020 Tree Traversals （25 分）（二叉樹的遍歷，后序中序轉(zhuǎn)層序）
題目 1020 Tree Traversals （25 分）Suppose that all the keys in a binary tree are distinct p...
-
PAT1004 Counting Leaves（30）（BFS，DFS，樹的層序遍歷）
類型：樹的遍歷，dfs 題目： A family hierarchy is usually presented by a pedigree tree. Your job is...
-
PAT1001 A+B Format （20 分）（字符串處理）
題目 分析題目： 兩個(gè)數(shù)字相加，然后需要以一定格式輸出。先求相加，然后把數(shù)字一個(gè)個(gè)對(duì)10取模輸出，相對(duì)比較容易。用棧做一個(gè)后進(jìn)后出就好了。 代碼： 總結(jié)： 做的時(shí)候沒用對(duì)容器...
-
