OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
    • Geometry
    • Count Primes
    • 441. Arranging Coins
    • Permutation Sequence
    • Range Addition II
    • 进制转换
    • Maximum Product of Three Numbers
    • Power of Three
    • Ugly Number
    • 1344. Angle Between Hands of a Clock
    • 66. Plus One
    • 780. Reaching Points
    • 564. Find the Closest Palindrome
    • Sqrt(x)
    • Factorial Trailing Zeroes
    • Strobogrammatic Number
    • 296. Best Meeting Point
    • 排列组合
    • Perfect Number
    • 加法
    • Nth Digit
    • Roman to Integer
    • Pow(x, n)
    • Divide Two Integers
    • GCD
    • Geometry
    • Super Pow
    • 829. Consecutive Numbers Sum
    • 找规律
    • Next Closest Time
    • 1362. Closest Divisors
    • Missing Ranges
    • Strobogrammatic Number III
    • 1154. Day of the Year
    • 1360. Number of Days Between Two Dates
    • Majority Element
    • 311. Sparse Matrix Multiplication
    • Maximum Swap
    • Reservoir Sampling
    • Integer Break
    • Largest Perimeter Triangle
    • 1363. Largest Multiple of Three
    • Binary Prefix Divisible By 5
    • 随机数
      • 470. Implement Rand10() Using Rand7()
      • 478. Generate Random Point in a Circle
      • 528. Random Pick with Weight
      • 710. Random Pick with Blacklist
      • 381. Insert/Del GetRandom O(1)-Duplicates allowed
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Math

随机数

470. Implement Rand10() Using Rand7()478. Generate Random Point in a Circle528. Random Pick with Weight710. Random Pick with Blacklist381. Insert/Del GetRandom O(1)-Duplicates allowed
PreviousBinary Prefix Divisible By 5Next470. Implement Rand10() Using Rand7()

Last updated 6 years ago

Was this helpful?