轻风舞动

2018年9月25日

[LeetCode] 597. Friend Requests I: Overall Acceptance Rate 朋友请求 I: 全部的接受率

摘要： In social network like Facebook or Twitter, people send friend requests and accept others’ requests as well. Now given two tables as below: Table: fri 阅读全文

posted @ 2018-09-25 12:55 轻风舞动阅读(1571) 评论(0) 推荐(0) 编辑

[LeetCode]577. Employee Bonus 员工奖金

摘要： Select all employee's name and bonus whose bonus is < 1000. Table:Employee Table: Bonus Example ouput: 选出所有奖金<1000元的雇员姓名及奖金数额解法1：解法2： All LeetCode Q 阅读全文

posted @ 2018-09-25 12:43 轻风舞动阅读(1207) 评论(0) 推荐(1) 编辑

570. Managers with at Least 5 Direct Reports 至少有5个直接汇报员工的经理

摘要： The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id. Given the Em 阅读全文

posted @ 2018-09-25 12:34 轻风舞动阅读(827) 评论(0) 推荐(0) 编辑

2018年9月24日

[LeetCode] 529. Minesweeper 扫雷

摘要： Let's play the minesweeper game (Wikipedia, online game)! You are given a 2D char matrix representing the game board. 'M' represents an unrevealed min 阅读全文

posted @ 2018-09-24 10:06 轻风舞动阅读(1269) 评论(0) 推荐(0) 编辑

2018年9月23日

Generate Maximum revenue by selling K tickets from N windows

摘要： Objective: Given ‘N’ windows where each window contains certain number of tickets at each window. Price of a ticket is equal to number of tickets rema 阅读全文

posted @ 2018-09-23 16:23 轻风舞动阅读(449) 评论(0) 推荐(0) 编辑

[LeetCode] 311. Sparse Matrix Multiplication 稀疏矩阵相乘

摘要： Given two sparse matrices A and B, return the result of AB. You may assume that A's column number is equal to B's row number. Example: 给2个稀疏矩阵，返回矩阵相乘的阅读全文

posted @ 2018-09-23 15:32 轻风舞动阅读(1791) 评论(0) 推荐(0) 编辑

[LeetCode] 689. Maximum Sum of 3 Non-Overlapping Subarrays 三个非重叠子数组的最大和

摘要： In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to max 阅读全文

posted @ 2018-09-23 14:36 轻风舞动阅读(599) 评论(0) 推荐(0) 编辑

[LeetCode] 403. Frog Jump 青蛙跳

摘要： A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but i 阅读全文

posted @ 2018-09-23 08:07 轻风舞动阅读(1281) 评论(0) 推荐(0) 编辑

[LeetCode] 656. Coin Path 硬币路径

摘要： Given an array A (index starts at 1) consisting of N integers: A1, A2, ..., AN and an integer B. The integer Bdenotes that from any place (suppose the 阅读全文

posted @ 2018-09-23 07:55 轻风舞动阅读(878) 评论(0) 推荐(0) 编辑

2018年9月22日

[LeetCode] 156. Binary Tree Upside Down 二叉树的上下颠倒

摘要： Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up 阅读全文

posted @ 2018-09-22 12:33 轻风舞动阅读(1103) 评论(0) 推荐(0) 编辑

公告