6-13 Point (10 分)

There is a class Point that is incompleted. Please complete the class according to the test code in Main.

函数接口定义:
class Point {
private double x;
private double y;
public String toString() {
return “(”+this.x+","+this.y+")";
}
}
裁判测试程序样例:
import java.util.Scanner;
class Point {
private double x;
private double y;
public String toString() {
return “(”+this.x+","+this.y+")";
}

/** 你所提交的代码将被嵌在这里(替换此行) **/

}

public class Main {
public static void main(String[] args) {
Point a = new Point(); // default ctor, x and y are zeros
Scanner sc = new Scanner(System.in);
double x,y,z;
x = sc.nextDouble();
y = sc.nextDouble();
z = sc.nextDouble();
Point b = new Point(x, y); // ctor by x and y
Point c = new Point(b); // ctor by another Point
a.setY(z);
System.out.println(a);
System.out.println(b);
System.out.println©;
c.setX(z);
a = b.add©;
System.out.println(a);
System.out.println(“b.x=”+b.getX()+" b.y="+b.getY());
sc.close();
}
}
输入样例:
3.14 1.9 2.72
输出样例:
(0.0,2.72)
(3.14,1.9)
(3.14,1.9)
(5.86,3.8)
b.x=3.14 b.y=1.9

public Point( ){
    this.x=0;
    this.y=0;
}
public Point(double x,double y){
    this.x=x;
    this.y=y;
}
public Point(Point o){
    this.x=o.x;
    this.y=o.y;//对象做方法的参数
}
public double getX(){
    return this.x;
}
public double getY(){
    return this.y;
}
public void setX(double m){
    this.x=m;
}
public void setY(double n){
    this.y=n;
}
public Point add(Object l){//括号里也可以是Point l
    Point ss=(Point) l;
    ss.x+=this.x;
    ss.y+=this.y;
    return ss;//真的不要忘记类型的返回值啊
}
  • 2
    点赞
  • 5
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
To discretize numeric data using 10-bins method, you can follow these steps: 1. Determine the range of your data: Find the minimum and maximum values of your numeric data. 2. Calculate the bin width: Calculate the difference between the maximum and minimum values, and divide it by the number of bins you want to create. In this case, we want to create 10 bins, so divide the range by 10. 3. Create the bins: Starting from the minimum value, create 10 equal-sized bins by adding the bin width to the previous bin's upper limit. The upper limit of the last bin should be equal to the maximum value. 4. Assign data points to bins: For each data point, find the bin it belongs to by comparing its value to the upper limit of each bin. If the data point is less than or equal to the upper limit of a bin, assign it to that bin. 5. Replace numeric values with bin labels: Once all data points have been assigned to bins, replace their numeric values with a label representing the bin they belong to. For example, if the bins are numbered from 1 to 10, a data point that belongs to the third bin would be labeled as "3". Here's an example: Suppose you have the following numeric data: 2, 5, 7, 10, 11, 13, 15, 18, 21, 25 1. The range of the data is from 2 to 25. 2. The bin width is (25 - 2) / 10 = 2.3 (rounded up to 3). 3. The 10 bins are: Bin 1: 2 - 4 Bin 2: 5 - 7 Bin 3: 8 - 10 Bin 4: 11 - 13 Bin 5: 14 - 16 Bin 6: 17 - 19 Bin 7: 20 - 22 Bin 8: 23 - 25 4. Assign data points to bins: 2 is in Bin 1 5 is in Bin 2 7 is in Bin 2 10 is in Bin 3 11 is in Bin 4 13 is in Bin 4 15 is in Bin 5 18 is in Bin 6 21 is in Bin 7 25 is in Bin 8 5. Replace numeric values with bin labels: 2 -> 1 5 -> 2 7 -> 2 10 -> 3 11 -> 4 13 -> 4 15 -> 5 18 -> 6 21 -> 7 25 -> 8 So the discretized data using 10-bins method would be: 1, 2, 2, 3, 4, 4, 5, 6, 7, 8

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

~晚风微凉~

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值