質問編集履歴
3
間違いの訂正
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -129,7 +129,7 @@
|
|
|
129
129
|
|
|
130
130
|
if (!isalpha(words[i][j]))continue; //空白だったらスキップ
|
|
131
131
|
|
|
132
|
-
answer[i] += (words[i][j] -
|
|
132
|
+
answer[i] += (words[i][j] - 'a' - 1); //文字を数値に変換
|
|
133
133
|
|
|
134
134
|
|
|
135
135
|
}
|
2
間違いの訂正
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -106,4 +106,40 @@
|
|
|
106
106
|
tester(3, words, expected);
|
|
107
107
|
}
|
|
108
108
|
}
|
|
109
|
+
```
|
|
110
|
+
|
|
111
|
+
修正版
|
|
112
|
+
```c
|
|
113
|
+
#include <stddef.h>
|
|
114
|
+
#include <stdlib.h> //malloc
|
|
115
|
+
#include <string.h> //strlen
|
|
116
|
+
#include <ctype.h> //isalpha
|
|
117
|
+
|
|
118
|
+
const int* name_value(size_t n, const char *const words[n]) {
|
|
119
|
+
|
|
120
|
+
size_t i;
|
|
121
|
+
int* answer = calloc(n,sizeof(int) );
|
|
122
|
+
|
|
123
|
+
|
|
124
|
+
for(i = 0; i < n; i++)
|
|
125
|
+
{
|
|
126
|
+
int l = strlen(words[i]);
|
|
127
|
+
for(size_t j = 0; j < (size_t)l; j++)
|
|
128
|
+
{
|
|
129
|
+
|
|
130
|
+
if (!isalpha(words[i][j]))continue; //空白だったらスキップ
|
|
131
|
+
|
|
132
|
+
answer[i] += (words[i][j] - 96); //文字を数値に変換
|
|
133
|
+
|
|
134
|
+
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
answer[i] *= (i + 1);
|
|
138
|
+
|
|
139
|
+
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
|
|
143
|
+
return answer;
|
|
144
|
+
}
|
|
109
145
|
```
|
1
間違いの訂正
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
codewarsというサイト内で問題を解いています。
|
|
1
|
+
codewarsというサイト内で問題を解いています。https://www.codewars.com/kata/598d91785d4ce3ec4f000018/train/c
|
|
2
2
|
文字列を与えられ、アルファベットのそれぞれの文字が値を持つとして、(a = 1, b = 2, c = 3 ....z = 26)
|
|
3
3
|
|
|
4
4
|
["abc","abc abc"] → [6,24]
|