MayUWell

Learn, Sleep, Learn

315-Count of Smaller Numbers After Self

Description: You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the...

2018-03-31 22:50:51

阅读数:39

评论数:0

546-Remove Boxes

Description: Given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove boxe...

2018-03-31 22:22:17

阅读数:29

评论数:0

730-Count Different Palindromic Subsequences

Description: Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subs...

2018-03-31 22:05:53

阅读数:37

评论数:0

782-Transform to Chessboard

Description: An N x N board contains only 0s and 1s. In each move, you can swap any 2 rows with each other, or any 2 columns with each other. What ...

2018-03-31 16:41:05

阅读数:51

评论数:0

699-Falling Squares

Description: On an infinite number line (x-axis), we drop given squares in the order they are given. The i-th square dropped (positions[i] = (left,...

2018-03-31 11:42:51

阅读数:42

评论数:0

微分卷一第一章

1.1和1.2主要介绍了微分的历史背景。直接来到1.3 1.3用穷举法求抛物线面积 如1.3所示的抛物线,它被包在其中一个顶点为(b, b2b2b^2)的矩形中。 由观察得知,抛物线的面积小于该矩形面积的一半。拉基米德得出结论:抛物线面积为13b313b3\frac{1}{3}b^3...

2018-03-30 01:03:52

阅读数:38

评论数:5

301-Remove Invalid Parentheses

Description: Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input...

2018-03-29 22:08:41

阅读数:22

评论数:0

517-Super Washing Machines

Description: You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty. For each move, you could ch...

2018-03-29 21:52:52

阅读数:54

评论数:0

502-IPO

Description: Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work o...

2018-03-29 21:36:50

阅读数:30

评论数:0

cookbook-第三章-处理数字和日期

截取数字 使用round() print(round(1.23, 1)) print(round(1.27, 1)) print(round(-1.27, 1)) print(round(1.25361, 3)) 1.2 1.3 -1.3 1.254 注意,使用round(),值在...

2018-03-28 22:56:21

阅读数:23

评论数:0

488-Zuma Game

Description: Think about Zuma Game. You have a row of balls on the table, colored red(R), yellow(Y), blue(B), green(G), and white(W). You also have ...

2018-03-28 21:03:06

阅读数:31

评论数:0

329-Longest Increasing Path in a Matrix

Description: Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left,...

2018-03-28 20:52:14

阅读数:32

评论数:0

42-Trapping Rain Water

Description: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to tra...

2018-03-28 20:39:40

阅读数:22

评论数:0

154-Find Minimum in Rotated Sorted Array II

Description: Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-time...

2018-03-28 20:31:19

阅读数:20

评论数:0

407-Trapping Rain Water II

Description: Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water...

2018-03-28 20:11:01

阅读数:25

评论数:0

128-Longest Consecutive Sequence

Description: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, ...

2018-03-28 19:37:52

阅读数:21

评论数:0

679-24 Game

Description: You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get th...

2018-03-27 21:02:51

阅读数:32

评论数:0

749-Contain Virus

Description: A virus is spreading rapidly, and your task is to quarantine the infected area by installing walls. The world is modeled as a 2-D arra...

2018-03-27 20:48:53

阅读数:33

评论数:0

514-Freedom Trail

Description: In the video game Fallout 4, the quest “Road to Freedom” requires players to reach a metal dial called the “Freedom Trail Ring”, and us...

2018-03-27 20:28:53

阅读数:23

评论数:0

410-Split Array Largest Sum

Description: Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays....

2018-03-26 22:53:05

阅读数:36

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭