LC 470. Implement Rand10() Using Rand7()

阿新 • • 發佈：2019-01-01

() fast discus pub inpu leetcode c++ write rate

Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a function rand10 which generates a uniform random integer in the range 1 to 10.

Do NOT use system‘s Math.random().

Example 1:

Input: 1
Output: [7]

Example 2:

Input: 2
Output: [8,4]

Example 3:

Input: 3
Output: [8,1,10]

Runtime: 88 ms, faster than 42.31% of C++ online submissions for Implement Rand10() Using Rand7().

不會做，好題，是一道極限近似題。

https://leetcode.com/problems/implement-rand10-using-rand7/discuss/150301/Three-line-Java-solution-the-idea-can-be-generalized-to-%22Implement-RandM()-Using-RandN()%22

class Solution {
public 
:
    int rand10() {
      int ret = 40;
      while(ret >= 40) {
        ret = 7 *(rand7()-1) + rand7()-1;  
      }
      return ret%10+1;
    }
};

LC 470. Implement Rand10() Using Rand7()

() fast discus pub inpu leetcode c++ write rate Given a function rand7 which generates a uniform random integer in the range 1 to 7, writ

[LeetCode] 470. Implement Rand10() Using Rand7()

tca input 其他 defined cte cti clas nim ted Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a fu

LeetCode 470. Implement Rand10() Using Rand7()

題意：已知一個函式可以uniformly randomly產生1-7，由此構造一個函式可以uniformly randomly產生1-10。首先rand7()+rand7()%4無法保證uniform，因為rand7()%4產生的0-3的概率就不是uniform的。這可以把rand7()和

[leetcode]470. Implement Rand10() Using Rand7()

[leetcode]470. Implement Rand10() Using Rand7() Analysis 今天被微博上的孫藝興bot笑死，哈哈哈哈哈—— [每天刷題並不難0.0] Given a function rand7 which generat

[LeetCode] Implement Rand10() Using Rand7() 使用Rand7()來實現Rand10()

leet wiki value tco tput min expected fin could Given a function rand7 which generates a uniform random integer in the range 1 to 7,

[Swift]LeetCode470. 用 Rand7() 實現 Rand10() | Implement Rand10() Using Rand7()

提示 sam ready 整數 turn mat fin memory class Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a fu

[LeetCode] 232. Implement Queue using Stacks Java

called java example lee empty from sem all 由於題目： Implement the following operations of a queue using stacks. push(x) -- Push element x

leetcode- 225 Implement Stack using Queues

col remove push stack return ret init 使用 ctu stack: 先進後出 pop(); push(); top(); size(); empty() queue：先進先出 pop(); push()

225. Implement Stack using Queues

棧隊列225. Implement Stack using Queuesfrom collections import deque class MyStack(object): def __init__(self): """ Initialize your data

LeetCode 225 Implement Stack using Queues（用隊列來實現棧）（*）

using man mean leetcode == peek uil erl end 翻譯用隊列來實現棧的例如以下操作。 push(x) —— 將元素x加入進棧 pop() —— 從棧頂移除元素 top() —— 返回棧頂元素 empty() —

[Leetcode] 232. Implement Queue using Stacks

兩個棧 following data 隊列 and win ont 使用 peek Implement the following operations of a queue using stacks. push(x) -- Push element x to the

[LeetCode] Implement Queue using Stacks

232. Implement Queue using Stacks

ole and push emp mean void ati whether style Implement the following operations of a queue using stacks. push(x) -- Push element x to th

[leetcode]Design-232. Implement Queue using Stacks

ack lis rip design supported sim ali standard mea Implement the following operations of a queue using stacks. push(x) -- Push element

【easy】225. Implement Stack using Queues

returns for 逆序 object front 簡單 truct clas whether 用隊列實現棧。這個實現方法十分的簡單，就是在push這一步的時候直接變成逆序。 class MyStack { private: queue<int>

Implement Queue using Two Stacks

som when tcl caller shuffle make com isempty use /* how to use two stacks to implement the queue: offer, poll, peek,size, isEmpty offe

[LeetCode] 225. Implement Stack using Queues 用隊列來實現棧

leetcode follow whether nothing sta BE may ack cti Implement the following operations of a stack using queues. push(x) -- Push element

[LeetCode] 232. Implement Queue using Stacks 用棧來實現隊列

logs not IT pty HA 實現 AC ted .cn Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of

Implement Deque Using Three Stacks

ole pri over sin cas clas alt integer shift 這是 Implement Deque Using Two Stacks 的升華版本，存一半有效的把時間復雜度最壞情況降低到O(N/2) 1 /* 2 dequeu

232 Implement Queue using Stacks 用棧來實現隊列

whether light 操作 move bool problem rem http rip 使用棧來實現隊列的如下操作： push(x) -- 將一個元素放入隊列的尾部。pop() -- 從隊列首部移除元素。peek() -- 返回隊列首部的元素。empty() --

LC 470. Implement Rand10() Using Rand7()

相關推薦