腾讯云开发者社区-腾讯云

开发者社区

文档建议反馈控制台

最新优惠活动

文章/答案/技术大牛

发布

计算机视觉与深度学习基础

专栏作者

314

文章

198467

阅读量

58

订阅数

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

编程算法机器学习深度学习神经网络人工智能

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u012614906/article/details/80329098

2019-05-25

8490

Leetcode 275. H-Index II

编程算法数据结构

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimiz

2018-03-27

4890

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. 计算一个数最少由多少个完全平方数相加而成。

2018-03-27

6740

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

2018-03-27

5770

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

2018-03-27

6980

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

2018-03-27

5320

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

2018-03-27

8080

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

2018-03-27

7020

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

2018-03-27

6360

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

2018-03-27

6690

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

2018-03-27

6610

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

2018-03-27

8210

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

2018-03-27

6790

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

2018-03-27

7050

POJ2253 && ZOJ1942

编程算法数据结构

两种写法用floyd算法，求所有点之间的最大跳的最小值，最后输出a[0][1]，即起始与终止位置的最小值，采用传递闭包的思路，时间复杂度较高，但代码简单。或者Dijkstru的变形，两点间的最短距离，只是最短距离的求法有变，当前加入一个点时，松弛方法不同，时间复杂度降低了。在数据结构编程实验一书上，看到二分的写法，感觉很巧妙。也是把三种写法都看一下，前两种为找到的代码，最后一种是自己写的。 floyd #include<stdio.h> #include<math.h>

2018-01-12

4760

神坑的题目思路就是枚举起点，迪杰斯特拉求最短路径，再枚举终点（如果起点终点一起枚举可能会超时，也能勉强扯上动态规划的思想吧），求最短路径。如果剪枝可以加一个变量存最大的点，这样就不用每一次都循环到数据边界1000。由于对自己很有自信，这题没有用模板写（事实是算法部分也没错，题目重边太坑），代码功能没分函数，整体有点乱。我是括号小王子O(∩_∩)O。 #include<iostream> #include<cstring> using namespace std; #define MAX 0xfff

2018-01-12

5880

水题第二弹题解

改过的标题很具有迷惑性哦！ A POJ3414本次代码量最大的一题，思想是搜索，详细解题报告，请见点击打开链接 B巨水，不要被题目迷惑了，连通图的性质最少需要（n-1）条边，所以可删 m-n+1条。 #include<iostream> #include<cstdio> using namespace std; int main() { int n,m; cin>>n>>m; for(int i=0;i<m;i++) { int a,b; sc

2018-01-12

6150

本以为对线段树还是比较熟悉的，但是这题改变了我的想法。顺着wk的题解做了这题。拿到手就知道线段树，写完T，这时候我想起来蓝桥杯的线段树也是这样的吧，只不过那题对区间的操作是log，真可笑，当时还以为是cin写跪了，就这题看来，估计也那题没过几组数据，二等奖也在情理之中。每次都更新到最底下会超时，每个数sqrt几次之后就会成为1，这时再开方是没有意义的，可以剪枝，如果区间长度等于区间和，说明区间没有必要更新，可以直接return。此外还有好几个WA点 #include<cstdio> #include

2018-01-12

5310

2014ACM/ICPC亚洲赛上海赛区总结

翘了中期检查来参赛心中有些害怕，前一天交待好后，12月5日下午来到上海，一行10人有说有笑，宾馆住下，晚上达神请吃饭，一切顺利。 12月6日下午开幕式，这次的领导讲话比较不同，幽默打趣，也了解了一些ACM在中国发展的历史。热身赛不幸又碰到了人品题，本着黑锅我来背的原则，从第8分钟开始到11分钟交了36发所有情况。后来发现直到第33发才是正确结果，而且由于评测机的问题，那一发成了36发中唯一没有判的。Kuangbin的模板功力深厚，所以其他题都是模板题，很遗憾没能做出来，据说

2018-01-12

7180

主席树POJ2104

求区间第k大数是多少用我惯用的线段树写法似乎不适合写主席树，看别人的代码好半天才看懂用root表示每一个前缀树的根，思想大致是由第i-1个树构成的树建第i个树，由于加入一个数只需要log级别修改，所以建树效率很高。主席树的精髓在于可持续化，就是说之前区间的信息不去修改它，递推加入新元素的时候，要新开log个空间来存储。因为主席树本身比较占用空间，只需改变这些空间的指向就可以重复利用不变的空间，达到节省空间的目的。简而言之，主席树是一种重复利用数据不变的空间，建成空间上只有一颗完整的树，但逻辑上是多颗

2018-01-12

6130

点击加载更多

社区活动

RAG七天入门训练营

鹅厂大牛手把手带你上手实战

Python精品学习库

代码在线跑，知识轻松学

博客搬家 | 分享价值百万资源包

自行/邀约他人一键搬运博客，速成社区影响力并领取好礼

技术创作特训营·精选知识专栏

往期视频·千货材料·成员作品最新动态