乐乐章

摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. Example: Input: 1 0 1 0 0 1 0 1 1 1 阅读全文

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar 阅读全文

摘要： Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: I 阅读全文

摘要： 情景描述： 服务器在学校，无公网ip，但是可以连上外网。我想用我的外网笔记本连接校内服务器。 条件： 由于我们自己使用的电脑未必有外网IP，因此我们需要一个有固定外网IP的服务器(随便搞个腾讯云、阿里云的小机子就行)， 然后用这台服务器与内网的机子进行通信，如果要用shell登录内网服务器，我们到时 阅读全文

摘要： Given an input string, reverse the string word by word. Example: Input: "the sky is blue", Output: "blue is sky the". Note: A word is defined as a seq 阅读全文

摘要： Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive intege 阅读全文

摘要： Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. Example 1: Input: [5,7] Output: 阅读全文

摘要： labuladong 题解思路 难度中等172 给你一个大小为 m x n 的二进制矩阵 grid ，其中 0 表示一个海洋单元格、1 表示一个陆地单元格。 一次 移动 是指从一个陆地单元格走到另一个相邻（上、下、左、右）的陆地单元格或跨过 grid 的边界。 返回网格中 无法 在任意次数的移动中离 阅读全文

摘要： 完整代码：https://github.com/zle1992/Reinforcement_Learning_Game 开山之作： 《Playing Atari with Deep Reinforcement Learning》（NIPS） http://export.arxiv.org/pdf/1 阅读全文

摘要： Given the head of a graph, return a deep copy (clone) of the graph. Each node in the graph contains a label (int) and a list (List[UndirectedGraphNode 阅读全文