Update 821.shortest-distance-to-a-character.md

daydaygo · daydaygo · commit 24f00864c6d7 · 2020-11-10T19:59:40.000+08:00
diff --git a/problems/821.shortest-distance-to-a-character.md b/problems/821.shortest-distance-to-a-character.md
@@ -109,13 +109,13 @@ Python3 Code：
 ```py
 class Solution:
     def shortestToChar(self, S: str, C: str) -> List[int]:
-        pre = -10000
+        pre = -20000
         ans = []
 
         for i in range(len(S)):
             if S[i] == C: pre = i
             ans.append(i - pre)
-        pre = 10000
+        pre = 20000
         for i in range(len(S) - 1, -1, -1):
             if S[i] == C: pre = i
             ans[i] = min(ans[i], pre - i)
@@ -129,14 +129,14 @@ class Solution {
     public int[] shortestToChar(String S, char C) {
         int N = S.length();
         int[] ans = new int[N];
-        int prev = -10000;
+        int prev = -20000;
 
         for (int i = 0; i < N; ++i) {
             if (S.charAt(i) == C) prev = i;
             ans[i] = i - prev;
         }
 
-        prev = 10000;
+        prev = 20000;
         for (int i = N-1; i >= 0; --i) {
             if (S.charAt(i) == C) prev = i;
             ans[i] = Math.min(ans[i], prev - i);
@@ -154,12 +154,12 @@ class Solution {
 public:
    vector<int> shortestToChar(string S, char C) {
        vector<int> ans(S.size(), 0);
-       int prev = -10000;
+       int prev = -20000;
        for(int i = 0; i < S.size(); i ++){
            if(S[i] == C) prev = i;
            ans[i] = i - prev;
        }
-       prev = 10000;
+       prev = 20000;
        for(int i = S.size() - 1; i >= 0; i --){
            if(S[i] == C) prev = i;
            ans[i] = min(ans[i], prev - i);
