腾讯云
开发者社区
文档
建议反馈
控制台
首页
学习
活动
专区
工具
TVP
最新优惠活动
文章/答案/技术大牛
搜索
搜索
关闭
发布
登录/注册
首页
学习
活动
专区
工具
TVP
最新优惠活动
返回腾讯云官网
计算机视觉与深度学习基础
专栏作者
举报
314
文章
193468
阅读量
58
订阅数
订阅专栏
申请加入专栏
全部文章
编程算法
return
integer
binary
numbers
dp
function
list
node.js
tree
dfs
element
distinct
duplicates
space
time
algorithm
input
set
map
sum
target
each
find
int
traversal
其他
深度学习
matrix
链表
机器学习
二叉树
数据结构
case
nodes
path
unique
图像处理
combinations
digits
grid
memory
minimum
null
position
root
runtime
search
using
排序
c++
add
it
leetcode
point
stock
搜索
tensorflow
java
bash
数据库
bash 指令
人工智能
http
opencv
area
bit
cycle
exists
line
max
min
permutation
pivot
range
sequence
size
stl
string
title
transactions
word
统计
sql
神经网络
容器
存储
游戏
tcp/ip
windows
absolute
arrays
character
click
contains
count
data
difference
excel
expression
google
hash
height
include
marked
median
merge
output
palindrome
process
properties
row
share
sort
store
this
集合
数组
优化
指针
字符串
python
javascript
xml
css
汇编语言
ide
git
github
api
linux
unix
mapreduce
数据库一体机 TData
腾讯云测试服务
网站
express
开源
spark
hadoop
正则表达式
面向对象编程
自动化测试
markdown
大数据
安全
数据处理
nat
bat
behavior
button
capture
cat
cell
children
colors
configuration
container
copy
definition
devise
diagram
dictionary
division
figure
file
final
flatten
form
friend
handle
homebrew
image
insert
instance
intervals
lines
lowercase
mapping
medium
methods
mock
multiplication
operators
overflow
parentheses
pascal
pointers
product
rectangles
recursion
rows
series
signature
structure
summary
transform
trie
vector
version
wikipedia
zero
博客
面试
算法
搜索文章
搜索
搜索
关闭
谷歌,微软,阿里,美团实习生面经
编程算法
机器学习
深度学习
神经网络
人工智能
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012614906/article/details/80329098
triplebee
2019-05-25
832
0
Github美化-Travis与Codecov入门
自动化测试
腾讯云测试服务
github
开源
markdown
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012614906/article/details/80405930
triplebee
2019-05-25
1.6K
0
Google面试经历-二
google
map
min
mock
面试
A Day with Google! Google实习生面试经历! A Day with Google活动 3月12日 ,A Day with Google GCJ获得资格,和mock i
triplebee
2018-04-16
963
0
Leetcode 274. H-Index
其他
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at l
triplebee
2018-03-27
551
0
Leetcode 275. H-Index II
编程算法
数据结构
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimiz
triplebee
2018-03-27
480
0
Leetcode 278. First Bad Version
其他
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version
triplebee
2018-03-27
576
0
Leetcode 279. Perfect Squares
编程算法
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9. 计算一个数最少由多少个完全平方数相加而成。
triplebee
2018-03-27
661
0
Leetcode 282. Expression Add Operators
编程算法
Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or *between the digits so they evaluate to the target value. Examples: "123", 6 -> ["1+2+3", "1*2*3"] "232", 8 -> ["2
triplebee
2018-03-27
565
0
Leetcode 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. For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0]. Note: You
triplebee
2018-03-27
682
0
Leetcode 284. Peeking Iterator
编程算法
Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek()operation -- it essentially peek() at the element that will be returned by the next call to next(). ---- Here is an exam
triplebee
2018-03-27
527
0
Leetcode 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, find the duplicate one. Note: You must not modify the
triplebee
2018-03-27
800
0
Leetcode 289. Game of Life
编程算法
According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970." Given a board with m by n cells, each cell has an initial state live (1) or dea
triplebee
2018-03-27
697
0
【深度学习】使用tensorflow实现VGG19网络
其他
接上一篇AlexNet,本文讲述使用tensorflow实现VGG19网络。 VGG网络与AlexNet类似,也是一种CNN,VGG在2014年的 ILSVRC localization and classification 两个问题上分别取得了第一名和第二名。VGG网络非常深,通常有16-19层,卷积核大小为 3 x 3,16和19层的区别主要在于后面三个卷积部分卷积层的数量。第二个用tensorflow独立完成的小玩意儿...... 同样先放上我的代码,由AlexNet的代码改过来的:https:
triplebee
2018-03-27
1.8K
0
Leetcode 290. Word Pattern
编程算法
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str. Examples: pattern = "abba", str = "dog cat cat dog" shoul
triplebee
2018-03-27
623
0
Leetcode 292. Nim Game
编程算法
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the sto
triplebee
2018-03-27
660
0
Leetcode 295. Find Median from Data Stream
编程算法
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value. Examples: [2,3,4] , the median is 3 [2,3], the median is (2 + 3) / 2 = 2.5 Design
triplebee
2018-03-27
649
0
Leetcode 297. Serialize and Deserialize Binary Tree
c++
编程算法
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 transmitted across a network connection link to be reconstructed later in the same or another computer en
triplebee
2018-03-27
807
0
Leetcode 299. Bulls and Cows
c++
编程算法
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your s
triplebee
2018-03-27
670
0
Leetcode 300. Longest Increasing Subsequence
c++
编程算法
Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that there may be more than
triplebee
2018-03-27
691
0
解读Batch Normalization
图像处理
本文转载自:http://blog.csdn.net/shuzfan/article/details/50723877 本次所讲的内容为Batch Normalization,简称BN,来源于《Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift》,是一篇很好的paper。 1-Motivation 作者认为:网络训练过程中参数不断改变导致后续每一层输入的分布也发生变化
triplebee
2018-03-27
725
0
点击加载更多
社区活动
Python精品学习库
代码在线跑,知识轻松学
点击查看
热点技术征文第五期
新风口Sora来袭,普通人该如何把握机会?
立即参加
博客搬家 | 分享价值百万资源包
自行/邀约他人一键搬运博客,速成社区影响力并领取好礼
立即体验
技术创作特训营·精选知识专栏
往期视频·干货材料·成员作品·最新动态
立即查看
领券
问题归档
专栏文章
快讯文章归档
关键词归档
开发者手册归档
开发者手册 Section 归档