{"title":"LeetCode - String Compression - Day15 (1/15/2020)","blog_url":"https://husky-tech.hatenablog.com/","height":"190","author_name":"hidehusky1996","blog_title":"Husky's diary","image_url":null,"published":"2020-01-15 10:50:44","width":"100%","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","description":"String Compression Question Given an array of characters, compress it in-place. The length after compression must always be smaller than or equal to the original array. Every element of the array should be a character (not int) of length 1. After you are done modifying the input array in-place, retu\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhusky-tech.hatenablog.com%2Fentry%2F2020%2F01%2F16%2F105044\" title=\"LeetCode - String Compression - Day15 (1/15/2020) - Husky&#39;s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/hidehusky1996/","type":"rich","version":"1.0","categories":["two pointer","LeetCode"],"url":"https://husky-tech.hatenablog.com/entry/2020/01/16/105044"}