beginner_and_go-CSDN博客

原创腾讯暑期实习现场一面

1.评价多分类的指标有什么？2.推一下极大似然估计3.解决梯度爆炸和梯度消失的方法有哪些？

2018-04-15 19:00:17 266

1.深度学习是怎样处理过拟合问题的？2.随机森林和GDBT分别是如何处理过拟合问题的？3.tensorflow中如何调试？4.RNN和LSTM之间的差别是什么，为什么会存在这样的差别？5.给一个文本，如何构建与文本有着相同概率分布的句子？6.l1,l2正则化项的作用和区别？7.给一亿个数，找出前100个最大的数。8.c++中的析构函数为什么是虚函数？9.回过头来再看你的项目，你觉得可以少走哪些弯路...

2018-03-30 09:19:01 199

原创 Hold住Leetcode——Submission Details

Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.To make problem a bit easier, all A, B, C, D have same l

2017-05-25 15:08:55 380

原创 Hold住Leetcode——Intersection of Two Arrays

Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].Note:Each element in the result must be unique.The result

2017-05-23 19:40:31 210

原创 Hold住Leetcode——Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note:Each element in the result should appear as many tim

2017-05-23 15:05:31 254

原创 Hold住Leetcode——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-05-22 19:34:36 198

原创 Hold住Leetcode——Guess Number Higher or Lower

We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is higher or low

2017-05-22 15:48:41 241

原创 Hold住Leetcode—— Sqrt(x)

自己实现开方函数思路：使用二分查找的思想，找到中间值，如果中间值的平方数大于目标值的话，那么将二分的右端点赋为中间值减1，不断循环，肯定可以定位到中间值的平方小于目标值的情况此时，判断中间值+1的平方是不是大于目标值，如果是，那么就返回此时的中间值，否，就将二分的左端点赋为中间值加1，再继续判断。class Solution {public: int mySqrt(int x) {

2017-05-22 11:33:56 152

原创 Hold住Leetcode——Arranging Coins

题目的意思是：给一个整数，将其分解成从1开始连续的几个数相加，返回那个最大的数。n = 5The coins can form the following rows:¤¤ ¤¤ ¤Because the 3rd row is incomplete, we return 2.n = 8The coins can form the following rows:¤¤ ¤¤

2017-05-21 19:39:21 195

原创 Hold住Leetcode——Two Sum II - Input array is sorted

题目的意思是找出容器中的两个值，使他们相加等于目标值，返回这两个值的索引。值得注意的是：容器中的数值是按顺序排列的一看到题目首先想到的就是二重循环的，结果这样就会超时class Solution {public: vector twoSum(vector& numbers, int target) { int size=numbers.size(); int

2017-05-21 17:07:03 187

原创 Hold住Leetcode

Given a positive integer num, write a function which returns True if num is a perfect square else False.判断输入的值是不是平方值，不能用sqrt()函数Example 1:Input: 16Returns: TrueExample 2:Inpu

2017-05-19 17:10:31 217

beginner_and_go的博客