triplebee-CSDN博客

原创谷歌，微软，阿里，美团实习生面经

新鲜出炉的实习生面经！主要包括：Google，微软，阿里，美团和因为各种原因没有面试成的公司…… 基本情况基本情况：某985硕士，常用语言C/C++、Python，研究方向为深度学习、计算机视觉，有一篇水的会议论文、一篇水的期刊论文，有ACM等算法竞赛和数据挖掘类竞赛获奖经历，在导师和Github上都有项目。除了谷歌投的是SWE，其它都是算法岗。谷歌Warm up: Go...

2018-05-15 20:48:33 4038 13

原创【深度学习】写诗机器人tensorflow实现

代码地址：https://github.com/hjptriplebee/Chinese_poem_generator，欢迎fork， star机器人命名MC胖虎，目前只是最简单粗暴的方法，使用tensorflow完成，有些像人工智障，符合胖虎的人物设定，看一些效果：LSTM的原理网上资料很多，不了解的可以看这里：http://www.jianshu.com/p/9dc9f41f

2017-06-29 14:51:02 28845 54

接上一篇AlexNet，本文讲述使用tensorflow实现VGG19网络。VGG网络与AlexNet类似，也是一种CNN，VGG在2014年的 ILSVRC localization and classification 两个问题上分别取得了第一名和第二名。VGG网络非常深，通常有16－19层，卷积核大小为 3 x 3，16和19层的区别主要在于后面三个卷积部分卷积层的数量。第二个用tensorflow独立完成的小玩意儿......同样先放上我的代码，由AlexNet的代码改过来的：https://g

2017-04-14 15:08:46 42157 32

原创 Github美化-Travis与Codecov入门

【开源项目利器】利用Travis持续集成与Codecov测试覆盖率构建自动化测试环境，提升Github项目逼格。始于颜值，陷于才华测试对于一个项目的重要性是不言而喻的，而小的开源项目往往难以配备专门的测试团队，频繁的push代码会使得本就缺乏人手的测试难上加难，因而构建自动化测试环境对于小型开源项目十分有必要！坦白说，我是一个先看脸的人，在不了解Travis和Codecov是做什么...

2018-05-22 15:05:59 4007

原创 Google面试经历-二

A Day with Google! Google实习生面试经历！ A Day with Google活动3月12日，A Day with Google GCJ获得资格，和mock interview配套的活动，参观了一下工作环境，拿了几个纪念品，放几张图。保护个人隐私，打个马赛克，纪念品，还有一个书包…旁边优美的风景… 越发加深了想去的执念，好好加油吧！Go...

2018-04-14 22:36:32 2826 1

原创 Google面试经历(一)

为什么是面试经历(一)呢？因为还有即将到来的： Google面试经历(二)-实习生面试以及可能会有的： Google面试经历(三)-实习生转正面试或者校招面试 Google面试经历(四)-失败总结 OK，下面正式写这次google mock interview的经历: 背景可能有人会奇怪，这么早就招人了吗？正常来说，是不会这么早的。但是因我为参加了20

2018-02-03 16:35:23 20180 3

原创【深度学习】谷歌deepdream原理及tensorflow实现

什么是DeepDream？DeepDream是谷歌发布的对卷积神经网络（CNN）进行可视化的方法，当然它的用途不仅限于此，我们可以通过它让机器“做梦”，以下是一些效果：可以看到计算机将自然图像的一些特征放大，生成了它想想中的一些物体。利用这个特点还可以生成一些从未有过的物体：DeepDream的原理卷积神经网络由于其从理论上难以解释，一直被很多学者诟病。在2013年

2017-09-07 16:03:44 23276 3

转载解读Batch Normalization

本文转载自：http://blog.csdn.net/shuzfan/article/details/50723877本次所讲的内容为Batch Normalization，简称BN，来源于《Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift》，是一篇很好的

2017-04-26 09:41:31 1335

原创 Leetcode 300. Longest Increasing Subsequence

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], ther

2017-04-20 09:32:52 1455

原创 Leetcode 299. Bulls and Cows

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 t

2017-04-19 17:12:42 1277

原创 Leetcode 297. Serialize and Deserialize Binary Tree

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

2017-04-19 16:50:08 1112

原创 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

2017-04-19 11:25:54 1264

原创 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

2017-04-18 17:47:08 1028

原创 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.

2017-04-18 17:33:21 1123

原创 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

2017-04-18 11:35:26 1061

原创 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,

2017-04-17 20:18:41 1296 2

原创 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 r

2017-04-17 17:49:27 1119

原创 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 you

2017-04-17 17:31:41 1036

原创 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.

2017-04-17 17:16:45 1095

原创 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 =

2017-04-16 21:18:15 1114

原创 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

2017-04-16 20:53:56 935

原创 Leetcode 275. H-Index II

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?接上一篇，数组升序排列。一看就是二分，需要注意边界，仔细想想。class Solution {public: int hIndex(ve

2017-04-16 20:04:03 988

原创 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

2017-04-16 19:02:56 990

原创 Leetcode 268. Missing Number

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm shoul

2017-04-15 14:56:58 1016

原创 Leetcode 264. Ugly Number II

Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first

2017-04-15 14:48:02 1064

原创 Leetcode 263. Ugly Number

Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly sinc

2017-04-15 14:24:15 1028

原创 Leetcode 258. Add Digits

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on

2017-04-15 14:03:37 908

原创 Leetcode 257. Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]求二叉树所有从根到

2017-04-15 13:50:26 829

原创 Leetcode 242. Valid Anagram

Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may ass

2017-04-15 13:31:49 847

原创 Leetcode 241. Different Ways to Add Parentheses

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example 1

2017-04-15 13:19:08 741

原创 Leetcode 240. Search a 2D Matrix II

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in

2017-04-14 16:45:36 1035

原创 Leetcode 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 window

2017-04-13 20:37:48 1289

原创 Leetcode 238. Product of Array Except Self

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O

2017-04-13 19:10:31 867

原创 Leetcode 237. Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value

2017-04-13 17:41:05 905

原创【深度学习】使用tensorflow实现AlexNet

转载注明出处：http://blog.csdn.net/accepthjp/article/details/69999309AlexNet是2012年ImageNet比赛的冠军，虽然过去了很长时间，但是作为深度学习中的经典模型，AlexNet不但有助于我们理解其中所使用的很多技巧，而且非常有助于提升我们使用深度学习工具箱的熟练度。尤其是我刚入门深度学习，迫切需要一个能让自己熟悉tensorfl

2017-04-10 20:35:48 23181 48

原创 Leetcode 236. Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two node

2017-04-06 10:30:50 1333

原创 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betwee

2017-04-06 10:19:46 1224

原创 Leetcode 234. Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?判断一个链表是否回文？要求O（n）时间复杂度，O（1）空间复杂度。快慢指针找到中点，将中点以后的逆置，再逐个判断是否相等/** * Definit

2017-04-06 09:38:46 1172

原创 Leetcode 233. Number of Digit One

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:Given n = 13,Return 6, because digit 1 occurred in the followin

2017-04-05 20:31:58 1119

原创 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() -- Removes the element from in front of queue.peek() -- Get the front element.empty(

2017-04-05 19:34:33 1102

mars-arp欺骗工具

USACO 2006年数据

空空如也