给定二维点 p(x 0 , y 0 )的坐标。找到距离该点 L 的点,使得连接这些点所形成的线的斜率为M。
例子:
输入: p = (2, 1)
L = sqrt(2)
M = 1
输出:3, 2
1, 0
解释:
与源的距离为 sqrt(2) ,并具有所需的斜率m = 1。
输入: p = (1, 0)
L = 5
M = 0
输出: 6, 0
-4, 0
我们需要找到与给定点距离为 L 的两个点,它们位于斜率为 M 的直线上。
这个想法已在下面的帖子中介绍:
C++ https://blog.csdn.net/hefeng_aspnet/article/details/141320964
Java https://blog.csdn.net/hefeng_aspnet/article/details/141321133
Python https://blog.csdn.net/hefeng_aspnet/article/details/141321178
C# https://blog.csdn.net/hefeng_aspnet/article/details/141321206
Javascript https://blog.csdn.net/hefeng_aspnet/article/details/141321238
根据输入的斜率,该问题可以分为 3 类。
1、如果斜率为零,我们只需要调整源点的 x 坐标
2、如果斜率无限大,则需要调整 y 坐标
3、对于其他斜率值,我们可以使用以下方程来找到点
现在利用上述公式我们可以找到所需的点。
// Javascript program to find the points on
// a line of slope M at distance L
// Class to represent a co-ordinate
// point
class Point
{
constructor(x, y)
{
this.x = x;
this.y = y;
}
}
// Function to print pair of points at
// distance 'l' and having a slope 'm'
// from the source
function printPoints(source, l, m)
{
// m is the slope of line, and the
// required Point lies distance l
// away from the source Point
let a = new Point();
let b = new Point();
// Slope is 0
if (m == 0)
{
a.x = source.x + l;
a.y = source.y;
b.x = source.x - l;
b.y = source.y;
}
// If slope is infinite
else if (!isFinite(m))
{
a.x = source.x;
a.y = source.y + l;
b.x = source.x;
b.y = source.y - l;
}
else
{
var dx = (l / Math.sqrt(1 + (m * m)));
var dy = m * dx;
a.x = source.x + dx;
a.y = source.y + dy;
b.x = source.x - dx;
b.y = source.y - dy;
}
// Print the first Point
document.write(a.x + ", " + a.y+"\n");
// Print the second Point
document.write(b.x + ", " + b.y+"\n");
}
// Driver code
let p = new Point(2, 1);
let q = new Point(1, 0);
printPoints(p, Math.sqrt(2), 1);
document.write("\n");
printPoints(q, 5, 0);
// This code is contributed by shruti456rawal
输出:
3, 2
1, 0
6, 0
-4, 0
时间复杂度: O(1)
辅助空间: O(1)