HackerRank Weighted Uniform Strings

https://www.hackerrank.com/challenges/weighted-uniform-string/problem

提出

8/32 test cases failed :(

code: python

#!/bin/python3

import math

import os

import random

import re

import sys

import string

# Complete the 'weightedUniformStrings' function below.

# The function is expected to return a STRING_ARRAY.

# The function accepts following parameters:

# 1. STRING s

# 2. INTEGER_ARRAY queries

def weightedUniformStrings(s, queries):

# Write your code here

chars = 0 * 26

for i, char in enumerate(list(string.ascii_lowercase)):

charsi = s.count(char)

sums = set()

for i in range(26):

for j in range(charsi):

sums.add((i+1)* (j+1))

results = []

for i in queries:

if i in sums:

results.append("Yes")

else:

results.append("No")

return results

if __name__ == '__main__':

fptr = open(os.environ'OUTPUT_PATH', 'w')

s = input()

queries_count = int(input().strip())

queries = []

for _ in range(queries_count):

queries_item = int(input().strip())

queries.append(queries_item)

result = weightedUniformStrings(s, queries)

fptr.write('\n'.join(result))

fptr.write('\n')

fptr.close()

解答

code: python

#!/bin/python3

import math

import os

import random

import re

import sys

# Complete the 'weightedUniformStrings' function below.

# The function is expected to return a STRING_ARRAY.

# The function accepts following parameters:

# 1. STRING s

# 2. INTEGER_ARRAY queries

def weightedUniformStrings(s, queries):

# Write your code here

result = []

# to store the weights present in the string

d = {}

weight = 0

# main logic

for i in range(len(s)):

# if adjacent char are different

if i == 0 or si != si-1:

weight = ord(si) - ord('a') + 1

else:

weight = weight + ord(si) - ord('a') + 1

# store the weight

dweight = 1

# result

for q in queries:

result.append("Yes" if q in d else "No")

return result