计算机视觉与深度学习基础-腾讯云开发者社区

开发者社区

文档建议反馈控制台

最新优惠活动

文章/答案/技术大牛

发布

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

专栏成员

314

文章

207574

阅读量

58

订阅数

Leetcode 25 Reverse Nodes in k-Group

node.js 编程算法

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is. You may not alter the values in the nodes, only nodes

2018-01-12

5260

Leetcode 24 Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself

2018-01-12

4370

Leetcode 87 Scramble String

node.js 编程算法

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / \ gr eat / \ / \ g r e at / \

2018-01-12

5330

Leetcode 86 Partition List

node.js 编程算法

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. For example, Given 1->4->3->2->5->

2018-01-12

4900

Leetcode 104 Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 求二叉树的最大深度。不说什么了。 /** * Definition for a binary tree node. * struct TreeNode { * int

2018-01-12

5280

Leetcode 98 Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys gre

2018-01-12

6620

Leetcode 124 Binary Tree Maximum Path Sum

Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path does not need to go through the root. For example:

2018-01-12

5900

Leetcode 116 Populating Next Right Pointers in Each Node

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set

2018-01-12

4250

Leetcode 111 Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 找出二叉树最小深度。和最大深度不同，需要判断是不是只有一个孩子的节点。 /** * Definition for a binary tree node. * struct Tre

2018-01-12

4990

Leetcode 138 Copy List with Random Pointer

编程算法 node.js

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. 复制一个带有随机后续节点的链表，因为随机后续节点可能在复制到当前结点时还没有被创建出来，所以需要保存新节点和老节点之间的对应关系。当然也有人通过在老节点后插入新节点的方法完

2018-01-12

5880

Leetcode 133 Clone Graph

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each node, and , as a separator for node label and each nei

2018-01-12

6310

Leetcode 160 Intersection of Two Linked Lists

编程算法 node.js

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B:

2018-01-12

3940

Leetcode 222. Count Complete Tree Nodes

二叉树 node.js

Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possi

2018-01-12

6550

Leetcode 236. Lowest Common Ancestor of a Binary Tree

node.js 二叉树

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 nodes v and w as the lowest node in T that has both v and w as

2018-01-12

5540

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 between two nodes v and w as the lowest node in T that has bot

2018-01-12

6360

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 3, the linked list should become 1 -> 2 -> 4after calli

2018-01-12

4010

没有更多了

社区活动

【纪录片】中国数据库前世今生

穿越半个世纪，探寻中国数据库50年的发展历程

Python精品学习库

代码在线跑，知识轻松学

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

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

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

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