题解 | #牛牛的平面向量#
牛牛的平面向量
https://www.nowcoder.com/practice/0e0d472d6a30469ab90d8b0aef7f81fe
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int x, y;
} Vector;
Vector AddVector(Vector* arr, int n) {
Vector ans = {0, 0};
for (int i = 0; i < n; i++) {
ans.x += (arr + i) -> x;
ans.y += (arr + i) -> y;
}
return ans;
}
int main() {
int n;
scanf("%d", &n);
Vector* array = (Vector*)malloc(n * sizeof(Vector));
for (int i = 0; i < n; i++) {
scanf("%d %d", & (array + i)->x, & (array + i)->y);
}
Vector ans = AddVector(array, n);
printf("%d %d", ans.x, ans.y);
return 0;
}
商汤科技二面4人在聊
查看10道真题和解析
投递阿里巴巴等公司10个岗位