Multiple substitutions specified in non-positional format; did you mean to add the fo

出现的问题:安卓出现字符串带百分号的情况,AS高级版本编译时出现下面问题:Error:(3575) Multiple substitutions specified in non-positional format; did you mean to add the formatted=”false” attribute?
  • 原因:string.xml中的 % 导致编译失败

  • 解决:其实,编译器已经提醒了,在string标签里面加formatted=”false”

<string name="desc3" formatted="false">%asd%da%dsa</string>
  • 网上还有一种办法的,就是加$符号,不过非常不不不灵活,最好用上面方式简单粗暴
  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Sure, I can help you with that. Here's a Python function that implements the autocorrect algorithm based on the input parameters: ``` def autocorrect(user_word, valid_words, diff_function, limit): if user_word in valid_words: return user_word min_diff = limit + 1 min_word = user_word for word in valid_words: diff = diff_function(user_word, word, limit) if diff < min_diff: min_diff = diff min_word = word elif diff == min_diff and valid_words.index(word) < valid_words.index(min_word): min_word = word if min_diff <= limit: return min_word else: return user_word ``` The function takes in the user_word, valid_words list, a diff_function, and a limit. The first if statement checks if the user_word is already in the valid_words list and returns it if so. Otherwise, it initializes the minimum difference and minimum word variables to the user_word. The function then iterates over all words in the valid_words list and calculates the difference between the user_word and each word using the provided diff_function. If the difference is less than the current minimum difference, the minimum difference and minimum word variables are updated. If the difference is equal to the minimum difference, the function returns the first word in the valid_words list that has that minimum difference. Finally, the function checks if the minimum difference is less than or equal to the limit and returns the minimum word if so. Otherwise, it returns the user_word. You can define your own diff_function based on your requirements. Here's an example diff_function that calculates the Levenshtein distance between two strings: ``` def levenshtein_distance(s1, s2, limit): if abs(len(s1) - len(s2)) > limit: return limit + 1 if s1 == s2: return 0 if len(s1) > len(s2): s1, s2 = s2, s1 prev_row = list(range(len(s1) + 1)) for i, c2 in enumerate(s2): curr_row = [i + 1] + [0] * len(s1) for j, c1 in enumerate(s1): insertions = prev_row[j + 1] + 1 deletions = curr_row[j] + 1 substitutions = prev_row[j] + (c1 != c2) curr_row[j + 1] = min(insertions, deletions, substitutions) prev_row = curr_row return prev_row[-1] ``` This function takes in two strings, s1 and s2, as well as the limit. It calculates the Levenshtein distance between the two strings and returns it if it is less than or equal to the limit. If the difference is greater than the limit, the function returns the limit plus one. You can call the autocorrect function with your own user_word, valid_words list, and diff_function. For example: ``` >>> user_word = "speling" >>> valid_words = ["spelling", "speaking", "swimming", "smiling"] >>> limit = 2 >>> autocorrect(user_word, valid_words, levenshtein_distance, limit) 'spelling' ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值