solves shortest distance to word

Author: anishLearnsToCode

Diff for: README.md

@@ -221,7 +221,7 @@
 | 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | |
 | 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [![Java](assets/java.png)](src/LargestTriangleArea.java) |
 | 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [![Java](assets/java.png)](src/MostCommonWord.java) |
-| 821 | [Shortest Distance to Character](https://leetcode.com/problems/shortest-distance-to-a-character) | |
+| 821 | [Shortest Distance to Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [![Java](assets/java.png)](src/ShortestDistanceToACharacter.java) |
 | 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | |
 | 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | |
 | 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | |

Diff for: src/ShortestDistanceToACharacter.java

@@ -0,0 +1,16 @@
+public class ShortestDistanceToACharacter {
+    public int[] shortestToChar(String string, char c) {
+        int[] answer = new int[string.length()];
+        for (int i = 0, l = Integer.MIN_VALUE ; i < string.length() ; i++) {
+            if (string.charAt(i) == c) l = i;
+            answer[i] = l == Integer.MIN_VALUE ? Integer.MAX_VALUE : i - l;
+        }
+
+        for (int i = string.length() - 1, r = Integer.MAX_VALUE ; i >= 0 ; i--) {
+            if (string.charAt(i) == c) r = i;
+            answer[i] = Math.min(answer[i], r - i);
+        }
+
+        return answer;
+    }
+}