{"push_id":2549160521,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9ab4b026df800329727a10f552b25d0c50acfade","before":"156b7c83d1da1871207ead1eaaa33e86e2b423d9","commits":[{"sha":"9ab4b026df800329727a10f552b25d0c50acfade","author":{"name":"Sukeysun","email":"d57f02853fe30f03bc2f581b97bbd5f00df974d0@qq.com"},"message":"Add files via upload\n\nYou're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in S is a type of stone you have.  You want to know how many of the stones you have are also jewels.\r\nThe letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so \"a\" is considered a different type of stone from \"A\".\r\nExample 1:\r\nInput: J = \"aA\", S = \"aAAbbbb\"\r\nOutput: 3\r\nExample 2:\r\nInput: J = \"z\", S = \"ZZ\"\r\nOutput: 0\r\nNote:\r\nS and J will consist of letters and have length at most 50.\r\nThe characters in J are distinct.","distinct":true,"url":"https://api.github.com/repos/Sukeysun/leetcodepython/commits/9ab4b026df800329727a10f552b25d0c50acfade"}]}
{"actor":{"display_login":"Sukeysun"}}