Given the radius and x-y positions of the center of a circle, write a function randPoint which generates a uniform random point in the circle.

Note:

1. input and output values are in floating-point.
2. radius and x-y position of the center of the circle is passed into the class constructor.
3. a point on the circumference of the circle is considered to be in the circle.
4. randPoint returns a size 2 array containing x-position and y-position of the random point, in that order.

Example 1:

Input: 
["Solution","randPoint","randPoint","randPoint"]
[[1,0,0],[],[],[]]
Output: [null,[-0.72939,-0.65505],[-0.78502,-0.28626],[-0.83119,-0.19803]]

Example 2:

Input: 
["Solution","randPoint","randPoint","randPoint"]
[[10,5,-7.5],[],[],[]]
Output: [null,[11.52438,-8.33273],[2.46992,-16.21705],[11.13430,-12.42337]]

Explanation of Input Syntax:

The input is two lists: the subroutines called and their arguments. Solution‘s constructor has three arguments, the radius, x-position of the center, and y-position of the center of the circle. randPoint has no arguments. Arguments are always wrapped with a list, even if there aren’t any.

Solution: Polar Coordinate

uniform sample an angle a: [0, 2*Pi)

uniform sample a radius r: [0, 1)

Number of random points in a cycle should be proportional to the square of distance to the center.

e.g. there are 4 times of points with distance d than points with distance d/2.

Thus sqrt(r) is uniformly distributed.

r’ = sqrt(r),

// Author: Huahua
// Running time: 116 ms
class Solution {
public:
  Solution(double radius, double x_center, double y_center)
    :r_(radius), x_(x_center), y_(y_center) {}

  vector<double> randPoint() {
    double a = rand() / static_cast<double>(RAND_MAX) * 2 * M_PI;
    double r = sqrt(rand() / static_cast<double>(RAND_MAX)) * r_;
    return {x_ + r * cos(a), y_ + r * sin(a)};
  }
private:
  double r_;
  double x_;
  double y_;
};

The post 花花酱 LeetCode 883. Generate Random Point in a Circle appeared first on Huahua's Tech Road.