{"push_id":844938770,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"58c71a989910ea8319a56f55d9c316b72bf688cb","before":"e2fcbefebc07a41ab7b0727540d2ed9d752c8f67","commits":[{"sha":"58c71a989910ea8319a56f55d9c316b72bf688cb","author":{"email":"c323f3a6ea614c393e21c7a14ff7b1be817458c5@gmail.com","name":"r930709"},"message":"Complete q6 iterative and recursive version\n\nIterative Concept detail:\n\n--First:\n\tFind the m address,previous m address ,and n address\n--Second:\nretimes = (n-m+1) if m = 3, n = 6\n\n1\t2\t3\t4\t5\t6\t7\t8\n\nretimes =  4\ninit\t\tcur\tnext\t\t\tprev\n*1\t\tprev\tcur\tnext\n*2\t\t\tprev\tcur\tnext\n*3\t\t\t\tprev\tcur\tnext\n*4\t\t\t\t\tprev\tcur\tnext\n\n--Third:\n\tcheck m whether is the head\n\nRecursive version concept same as the iterative version.","distinct":true,"url":"https://api.github.com/repos/r930709/quiz/commits/58c71a989910ea8319a56f55d9c316b72bf688cb"}]}