CodeWars
CodeWars
coolsunxu
仅仅记录下自己的成长,不喜勿喷
展开
-
Multiplying numbers as strings(C++CodeWars)
Multiplying numbers as strings(C++CodeWars)原创 2021-04-16 14:48:14 · 249 阅读 · 0 评论 -
Reverse or rotate?(C++CodeWars)
Reverse or rotate?(C++CodeWars)原创 2020-05-05 12:26:41 · 220 阅读 · 0 评论 -
Help the bookseller !(C++CodeWars)
Help the bookseller !(C++CodeWars)原创 2020-05-03 17:34:51 · 179 阅读 · 0 评论 -
Delete occurrences of an element if it occurs more than n times(C语言CodeWars)
Delete occurrences of an element if it occurs more than n times(C语言CodeWars)原创 2020-05-03 08:29:44 · 219 阅读 · 0 评论 -
Irreducible Sum of Rationals(C语言CodeWars)
Irreducible Sum of Rationals(C语言CodeWars)原创 2020-05-03 08:06:36 · 256 阅读 · 0 评论 -
Product of consecutive Fib numbers(C语言CodeWars)
Product of consecutive Fib numbers(C语言CodeWars)原创 2020-05-02 20:25:27 · 220 阅读 · 0 评论 -
Detect Pangram(C语言CodeWars)
Detect Pangram(C语言CodeWars)原创 2020-05-01 14:27:19 · 391 阅读 · 0 评论 -
Sum The Tree(C语言CodeWars)
Sum The Tree(C语言CodeWars)原创 2020-05-01 09:48:51 · 232 阅读 · 0 评论 -
Lottery Ticket(C语言CodeWars)
解题思路:(1)注意这里是两个结构体(2)依次访问,判断是否存在相等(3)看了别人的解题方法,原来还有一个strchr函数!!!#include <stdio.h>#include <stdlib.h>typedef struct mini_win_t { char *letters; unsigned code;} Mini...原创 2020-04-26 18:12:49 · 465 阅读 · 0 评论 -
k-Primes(C语言CodeWars)
解题思路:(1)首先求出因数的个数,并同时插入链表(2)接下来,用开始的函数分别求出1,3,7的链表(3)三层循环,判断个数,有点百钱买鸡的味道#include <stdio.h>#include <stdlib.h>#include <string.h>// In the preloaded section are some func...原创 2020-04-25 12:28:36 · 421 阅读 · 0 评论 -
Simple transposition(C语言CodeWars)
解题思路:(1)使用下标的奇偶性(2)将对应的字符赋值给对应的字符串,最后连接#include <string.h>char *simple_transposition(const char *s) { char *row1 = (char*)calloc(strlen(s)+1,sizeof(char)); char *row2 = (char...原创 2020-04-25 10:44:03 · 179 阅读 · 0 评论 -
Moves in squared strings (II)(C语言CodeWars)
解题思路:(1)利用之前的函数,实现反转,原来还有函数strrev(),我好笨呀(2)将其拆分为两部分,分别处理,最后再拼接起来#include <stdio.h>#include <stdlib.h>#include <string.h> char* horMirror(char* strng) { int tlen = strl...原创 2020-04-24 19:02:48 · 177 阅读 · 0 评论 -
Gap in Primes(C语言CodeWars)
解题思路:(1)使用快速的素数(质数)判断法(2)记录前一个素数,并和当前的素数比较int isprime(long long n){ if(n==2||n==3) return 1; if(n%6!=1 && n%6!=5) return 0; for(long long i=5;i<=floor(sqrt(n));i+=6) if(n%i==0||...原创 2020-04-24 15:44:12 · 272 阅读 · 0 评论 -
Best travel(C语言CodeWars)
解题思路:(1)使用组合来求所需要的数组(2)不知名错误。。。#include <stdlib.h>void combination(int *max, int t, int p[], int k, int ls[], int szls, int begin, int index) { if(k==0) { int sum = 0; for(int i=0;i...原创 2020-04-24 14:34:55 · 554 阅读 · 0 评论 -
Square into Squares. Protect trees!(C语言CodeWars)
解题思路:(1)因为没有通过全部测试,因此这里仅仅讲一下怎么讲整数数组变为字符串(2)使用asprintf,reallocchar *num2string(long long *numbers,int count) { //数组以及个数 char *p = (char*)calloc(1,sizeof(char)); p[0]='['; if(count>...原创 2020-04-24 09:39:52 · 290 阅读 · 0 评论 -
Mexican Wave(C语言CodeWars)
解题思路:(1)注意空格是不被考虑的#include <ctype.h>void wave(const char *y, char **target) { int count=0,counts=0; const char *p = y; while(*y!='\0') { if(!isspace(*y)) { strcpy(target[...原创 2020-04-23 19:25:18 · 302 阅读 · 0 评论 -
Moves in squared strings (I)(C语言CodeWars)
解题思路:(1)首先复制字符串,这样可以减少对"\n"的操作(2)将看似二维的数,一维展开,在纸上找找感觉~#include <stdio.h>#include <stdlib.h>char* horMirror(char* strng) { int tlen = strlen(strng),cols,begin,end; char *s...原创 2020-04-23 18:35:01 · 182 阅读 · 0 评论 -
Integers: Recreation One (C语言CodeWars)
解题思路:(1)解法很暴力(2)就是指针不太熟悉,容易出错,哈哈哈#include <stdio.h>#include <stdlib.h>#include <math.h>typedef struct Pair Pair;struct Pair { long long first; long long snd;};/...原创 2020-04-23 13:14:23 · 197 阅读 · 0 评论 -
Complementary DNA(C CodeWars)
解题思路:(1)遍历,对应修改char *dna_strand(const char *dna) { char *str = calloc(strlen(dna)+1,sizeof(char)); int count = 0; while(*dna!='\0') { switch(*dna) { case 'A': str[count++]='T';dna...原创 2020-04-23 10:44:52 · 259 阅读 · 0 评论 -
Equal Sides Of An Array(C CodeWars)
解题思路:(1)dp[i]记录values从起始位置0到当前位置[i]的和(2)再重新遍历,寻找满足公式的下标int find_even_index(const int *values, int length) { int *dp = calloc(length,sizeof(int)); int sum = 0; for(int i=0;i<length;i++...原创 2020-04-21 15:32:24 · 204 阅读 · 0 评论 -
Maximum subarray sum(C语言CodeWars)
参考网址:https://www.codewars.com/kata/54521e9ec8e60bc4de000d6c/solutions/chttps://www.cnblogs.com/TenosDoIt/p/3698246.html解题思路:(1)动态规划, 数组为array,设dp[i] 是以array[i]结尾的子数组的最大和(2)对于元素array[i+1], 它有...原创 2020-04-20 18:39:26 · 209 阅读 · 0 评论 -
Who likes it?(C语言CodeWars)
参考网址:https://www.codewars.com/kata/5266876b8f4bf2da9b000362/solutions/c(1)使用asprintf,asprintf()可以说是一个增强版的sprintf()(2)在不确定字符串的长度时,能够根据格式化的字符串长度,申请足够的内存空间。char* likes(size_t n, const char *const ...原创 2020-04-17 21:52:10 · 474 阅读 · 0 评论 -
Shortest Word(C语言CodeWars)
解题思路:将空格作为分隔符ssize_t find_short(const char *s) { ssize_t min = INT_MAX,count = 0; while(*s!='\0') { if (*s!=' ') { count = 0; while(*s!=' ' && *s!='\0') { count++; s++; ...原创 2020-04-16 09:55:18 · 217 阅读 · 0 评论 -
Sum without highest and lowest number
解题思路:一次循环,双管齐下int sum(int* numbers, int numbersCount) { if (numbersCount==0 || numbersCount==1) return 0; int min = numbers[0],max = numbers[0],sum=numbers[0]; for (int i=1;i<numbersCount;...原创 2020-04-14 19:26:25 · 167 阅读 · 0 评论 -
C语言Build a pile of Cubes
解题思路:根据数学三次方求和的数学公式long long findNb(long long m) { // your code long long sq = sqrt(m); if (sq*sq!=m) return -1; long long sp = sqrt(2*sq); if (sp*(sp+1)!=2*sq) return -1; else return s...原创 2020-04-14 17:42:32 · 194 阅读 · 0 评论 -
C语言Disemvowel Trolls
解题思路:依次判断,注意指针的使用char *disemvowel(const char *str) { int length = 0; char *dis=(char*)calloc(strlen(str)+1, sizeof(char));; while(*str!='\0') { if (*str!='a' && *str!='e' &&a...原创 2020-04-14 16:44:02 · 191 阅读 · 0 评论 -
Mumbling
好久没写C语言了,太费劲了,哈哈哈哈char *accum(const char *source) { if (*source=='\0') { return ""; } int size=0; const char *temp=source; //获得字符串大小 while(*temp++) { size++; } //分配内存 char *str=(ch...原创 2019-04-19 21:49:32 · 293 阅读 · 0 评论