题目描述：
LeetCode 368. Largest Divisible Subset
Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % S ...
标签归档：leetcode
[LeetCode]Largest Divisible Subset
[LeetCode]Valid Perfect Square
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 367. Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function such as sqrt.
Example 1:
Input: 16 ...
[LeetCode]Water and Jug Problem
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 365. Water and Jug Problem
You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres ...
[LeetCode]Max Sum of Rectangle No Larger Than K
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 363. Max Sum of Rectangle No Larger Than K
Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k ...
[LeetCode]Count Numbers with Unique Digits
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 357. Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
Example:
Given n = 2, return 91. (The answer should be the total numbers ...