mirror of https://github.com/01-edu/public.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1.3 KiB
1.3 KiB
Rectangle
Instructions
Consider that a point is defined by its coordinates and that a rectangle is defined by the points of the upper left and lower right corners.
-
Define two structures named,
point
andrectangle
. -
The struct
point
has to have two variables,x
andy
, typeint
. -
The struct
rectangle
has to have two variables,upLeft
anddownRight
typepoint
. -
The goal is to make a program that:
- Given a slice of points of size
n
returns the smallest rectangle that contains all the points in the vector of points. The name of that function isdefineRectangle
. - And which calculates and prints the area of that rectangle you define.
- Given a slice of points of size
Expected main and function for the program
func defineRectangle(ptr *point, n int) *rectangle {
}
func calArea(ptr *rectangle) int {
}
func main() {
vPoint := []point{}
rectangle := &rectangle{}
n := 7
for i := 0; i < n; i++ {
val := point{
x: i%2 + 1,
y: i + 2,
}
vPoint = append(vPoint, val)
}
rectangle = defineRectangle(vPoint, n)
fmt.Println("area of the rectangle:", calArea(rectangle))
}
Expected output
student@ubuntu:~/[[ROOT]]/test$ go build
student@ubuntu:~/[[ROOT]]/test$ ./test
area of the rectangle: 6
student@ubuntu:~/[[ROOT]]/test$