- 博客(23)
- 资源 (17)
- 收藏
- 关注
RSS订阅原创 347. Top K Frequent Elements 前K个高频元素
Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2] Example 2: Input: nums = [1], k = 1Output:...
2019-02-25 20:26:12
194
原创 239. Sliding Window Maximum 滑动窗口最大值
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding wind...
2019-02-25 19:54:08
189
原创 287. Find the Duplicate Number 寻找重复数
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number...
2019-02-24 21:14:55
157
原创 283. Move Zeroes 移动零
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12]Output: [1,3,12,0,0] ...
2019-02-24 20:49:47
154
原创 169. Majority Element 求众数
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋times. You may assume that the array is non-empty and the majority elemen...
2019-02-24 20:29:19
154
原创 238. Product of Array Except Self 除自身以外数组的乘积
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Example: Input: [1,2,3,4...
2019-02-24 20:20:57
126
原创 155. Min Stack 最小栈
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. ...
2019-02-24 20:10:55
176
原创 152. Maximum Product Subarray 乘积最大子序列
Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: Input: [2,3,-2,4]Output: 6Explanatio...
2019-02-24 20:03:02
171
转载 Faster RCNN
作者：白裳链接：https://zhuanlan.zhihu.com/p/31426458来源：知乎著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。经过R-CNN和Fast RCNN的积淀，Ross B. Girshick在2016年提出了新的Faster RCNN，在结构上，Faster RCNN已经将特征抽取(feature extraction)，proposa...
2019-02-24 10:51:20
1105
原创 137. Single Number II 只出现一次的数字 II
Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your algorithm should have a linear runtim...
2019-02-22 23:19:58
139
原创 136. Single Number 只出现一次的数字
Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it ...
2019-02-22 22:47:17
143
原创 leetcode-79. Word Search 单词搜索
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or verti...
2019-02-22 22:40:43
221
原创 leetcode-4. Median of Two Sorted Arrays 寻找两个有序数组的中位数
There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assumen...
2019-02-21 23:15:27
135
转载 多目标跟踪算法评价指标
转自：https://blog.csdn.net/yunduwu0010/article/details/53082883标准CLEAR-MOT测量，包括：Multi-Object Tracking Accuracy(MOTA) Multi-ObjectTracking Precision (MOTP)这两个评价标准。此外，额外引入了若干指标来进行评价：↑：表示得分越高越好，反之亦然。...
2019-02-21 18:21:07
5524
4
原创 324. Wiggle Sort II 摆动排序 II
Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Example 1: Input: nums = [1, 5, 1, 1, 6, 4]Output: One possible answer is [1, 4, 1, ...
2019-02-21 17:57:20
229
原创 lintcode-508. Wiggle Sort
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... Example Example 1: Input: [3, 5, 2, 1, 6, 4]Output: [1, 6...
2019-02-21 17:44:15
137
原创 leetcode-146. LRU Cache LRU缓存机制
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the value (will always be positive) of the ke...
2019-02-20 23:13:00
195
原创 leetcode-215. Kth Largest Element in an Array 数组中的第K个最大元素
Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 1: Input: [3,2,1,5,6,4] and k = 2Out...
2019-02-20 21:42:30
160
转载 语义分割 各种loss实现 python
文章转自：https://blog.csdn.net/wangdongwei0/article/details/84576044，侵删前言：在参加Kaggle的比赛中，有时遇到的分割任务是那种背景所占比例很大，但是物体所占比例很小的那种严重不平衡的数据集，这时需要谨慎的挑选loss函数。Loss：1.Log loss log loss其实就是TensorFlow中的 tf.l...
2019-02-19 11:43:38
8883
3
转载 卷积计算，反卷积计算，特征图大小计算，空洞卷积计算
转自：https://www.jianshu.com/p/09ea4df7a788?utm_source=oschina-app卷积计算过程（单/RGB多通道） 特征图大小计算公式 转置卷积（反卷积）计算过程 空洞卷积计算过程卷积计算过程（单/RGB多通道）假设输入层的大小为 5 x 5，局部感受野（或称卷积核）的大小为 3 x 3，那么输出层一个神经元所对应的计算过程（下文...
2019-02-14 09:45:46
22249
1
原创 深度可分离卷积Depthwise Separable Convolution
参考：https://blog.csdn.net/u011974639/article/details/79199306深度可分离卷积在MobileNet和Xception中出现过，这里只是理解卷积过程，不涉及MobileNet和Xception。通俗来说，深度可分离卷积就是：把标准卷积分解成深度卷积(depthwise convolution)和逐点卷积(pointwise convol...
2019-02-12 18:45:48
9216
21
原创 语义分割(semantic segmentation)--DeepLabV3之ASPP(Atrous Spatial Pyramid Pooling)代码详解
ASPP： Atrous Spatial Pyramid Poolingdeeplabv2中的aspp如上图所示，在特征顶部映射图使用了四中不同采样率的空洞卷积。这表明以不同尺度采样时有效的，在Deeolabv3中向ASPP中添加了BN层。不同采样率的空洞卷积可以有效捕获多尺度信息，但会发现随着采样率的增加，滤波器有效权重（权重有效的应用在特征区域，而不是填充0）逐渐变小。如下图当...
2019-02-12 12:51:34
58749
12
原创 基于resnet34的unet
pytorch版本：https://blog.csdn.net/github_36923418/article/details/83273107keras版本：https://blog.csdn.net/m0_37477175/article/details/83861678
2019-02-02 21:46:22
7523
OpenCV 3.x with Python By Example 2nd .txt
2019-06-01
OpenCV-3-x-with-Python-By-Example-master.zip
2019-05-31
传智播客python课件
2019-01-26
强化学习Reinforcement learning:An introduction第二版
2018-10-16
斯坦福cs234强化学习ppt教程reinforcement learning
2018-10-10
迁移学习教程，Transfer learning介绍，TL调查
2018-10-08
深度学习优化算法大全
2018-10-08
Deep Learning for Computer Vision by Dr. Stephen Moore
2018-09-18
Deep Learning for Computer Vision with Python123
2018-09-18
Hands On Machine Learning with Scikit-Learn and TensorFlow20173
2018-07-03
David Silver强化学习课件ppt
2018-07-03
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人