字符串字符的字母值之和

给你一个字符串数组str ，任务是从数组中找到给定字符串s的分数。字符串的分数定义为其字符的字母值之和与字符串在数组中的位置的乘积。
例子：

Input: str[] = {“sahil”, “shashanak”, “sanjit”, “abhinav”, “mohit”}, s = “abhinav”
Output: 228
Sum of alphabetical values of “abhinav” = 1 + 2 + 8 + 9 + 14 + 1 + 22 = 57
Position of “abhinav” in str is 4, 57 x 4 = 228
Input: str[] = {“geeksforgeeks”, “algorithms”, “stack”}, s = “algorithms”
Output: 244

编程需要懂一点英语

方法：

在数组中找到给定的字符串并存储字符串的位置。
然后计算给定字符串的字母值之和。
将字符串在给定数组中的位置与上一步计算的值相乘并打印结果。

下面是上述方法的实现：

C++

// C++ implementation of the approach
#include 
using namespace std;
 
// Function to find string score
int strScore(string str[], string s, int n)
{
    int score = 0, index;
    for (int i = 0; i < n; i++) {
        if (str[i] == s) {
            for (int j = 0; j < s.length(); j++)
                score += s[j] - 'a' + 1;
            index = i + 1;
            break;
        }
    }
 
    score = score * index;
    return score;
}
 
// Driver code
int main()
{
    string str[] = { "sahil", "shashanak"
                      , "sanjit", "abhinav", "mohit" };
    string s = "abhinav";
    int n = sizeof(str) / sizeof(str[0]);
    int score = strScore(str, s, n);
    cout << score << endl;
 
    return 0;
}

Java

//  Java implementation of the approach
import java.io.*;
 
class GFG {
 
 
// Function to find string score
static int strScore(String str[], String s, int n)
{
    int score = 0, index=0;
    for (int i = 0; i < n; i++) {
        if (str[i] == s) {
            for (int j = 0; j < s.length(); j++)
                score += s.charAt(j) - 'a' + 1;
            index = i + 1;
            break;
        }
    }
 
    score = score * index;
    return score;
}
 
// Driver code
 
 
    public static void main (String[] args) {
            String str[] = { "sahil", "shashanak"
                    , "sanjit", "abhinav", "mohit" };
    String s = "abhinav";
    int n = str.length;
    int score = strScore(str, s, n);
    System.out.println( score);
    }
}
// This code is contributed by anuj_67..

Python3

# Python3 implementation of the approach
# Function to find string score
def strScore(str, s, n):
    score = 0
    index = 0
    for i in range(n):
        if (str[i] == s):
            for j in range(len(s)):
                score += (ord(s[j]) -
                          ord('a') + 1)
            index = i + 1
            break
    score = score * index
    return score
 
# Driver code
str = ["sahil", "shashanak", "sanjit",
                  "abhinav", "mohit" ]
s = "abhinav"
n = len(str)
score = strScore(str, s, n);
print(score)
 
# This code is contributed
# by sahishelangia

C#

// C# implementation of the approach
using System;
 
class GFG
{
 
// Function to find string score
static int strScore(String []str,
                    String s, int n)
{
    int score = 0, index = 0;
    for (int i = 0; i < n; i++)
    {
        if (str[i] == s)
        {
            for (int j = 0; j < s.Length; j++)
                score += s[j] - 'a' + 1;
            index = i + 1;
            break;
        }
    }
 
    score = score * index;
    return score;
}
 
// Driver code
public static void Main (String[] args)
{
    String []str = { "sahil", "shashanak", "sanjit",
                     "abhinav", "mohit" };
    String s = "abhinav";
    int n = str.Length;
    int score = strScore(str, s, n);
    Console.Write( score);
}
}
 
// This code is contributed by 29AjayKumar

PHP

Javascript

输出：