❤1
👍1
int LetteredNumberSum(char* str, int len) {
if (str == nullptr) {
return 0;
}
int sum = 0;
for (int i = 0; i < len; i++) {
char letter = str[i];
int ans = 0;
//@allcoding1
switch (letter) {
case 'A':
ans = 1;
break;
case 'B':
ans = 10;
break;
case 'C':
ans = 100;
break;
case 'D':
ans = 1000;
break;
case 'E':
ans = 10000;
break;
case 'F':
ans = 100000;
break;
case 'G':
ans = 1000000;
break;
default:
ans = 0;
break;
}
sum += ans;
}
return sum;
}
C++
join this channel 👇
@allcoding1_official
@accenture_examAns
if (str == nullptr) {
return 0;
}
int sum = 0;
for (int i = 0; i < len; i++) {
char letter = str[i];
int ans = 0;
//@allcoding1
switch (letter) {
case 'A':
ans = 1;
break;
case 'B':
ans = 10;
break;
case 'C':
ans = 100;
break;
case 'D':
ans = 1000;
break;
case 'E':
ans = 10000;
break;
case 'F':
ans = 100000;
break;
case 'G':
ans = 1000000;
break;
default:
ans = 0;
break;
}
sum += ans;
}
return sum;
}
C++
join this channel 👇
@allcoding1_official
@accenture_examAns
👍3🙏1