第十三天:指针、数组指针、指针数组

void yanghui_triangle() {
  int c;
  printf("几层:");
  scanf("%d", &c);
  int triangle[c][c];
  int (*p)[c] = triangle;
  for (int i = 0; i < c; ++i) {
    for (int j = 0; j < c; ++j) {
      if (j == 0 || i == j) {
        *(*(p + i) + j) = 1;
      } else {
        *(*(p + i) + j) = *(*(p + i - 1) + j - 1) + *(*(p + i - 1) + j);
      }
    }
  }
  for (int i = 0; i < c; ++i) {
    for (int j = 0; j <= i; ++j) {
      printf("%4d", *(*(p + i) + j));
    }
    printf("\n");
  }
}

void transpose_print() {
  int arr[2][3];
  int (*p)[3] = arr;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 3; j++) {
      scanf("%d", *(p + i) + j);
    }
  }
  printf("\n");
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 2; j++) {
      printf("%d", *(p[j] + i));
    }
  }
}

int str_cmp(char *s1, char *s2) {
  while (1) {
    if (*s1 - *s2) {
      return *s1 - *s2;
    }
    if (*s1 == '\0' && *s2 == '\0') {
      return 0;
    }
    ++s1;
    ++s2;
  }
}

char *str_cat(char *source, char *target) {
  char *p = source;
  while (*(p++));
  p--;
  while (*target) {
    *p = *target;
    p++;
    target++;
  }
  return source;
}

void reverse_order_string() {
  char *a = (char *) malloc(100);
  fgets(a, 100, stdin);
  unsigned long length = strlen(a);
  for (int i = 0; i <= (length - 1) / 2; ++i) {
    *(a + i) = *(a + i) ^ *(a + length - 1 - i);
    *(a + length - 1 - i) = *(a + i) ^ *(a + length - 1 - i);
    *(a + i) = *(a + i) ^ *(a + length - 1 - i);
  }
  printf("%s", a);
  free(a);
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值