{"push_id":672202498,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3f165790d81e956de4c65241dd892d57c31dd315","before":"166be091e30defd9e4d4f560c9a123d8e10880ec","commits":[{"sha":"3f165790d81e956de4c65241dd892d57c31dd315","author":{"email":"e6aadcde585f06dcf1bdf56070478ec4283ca81e@163.com","name":"tianmn2109"},"message":"Add problem 155: Min Stack\n\n Design a stack that supports push, pop, top, and retrieving the minimum\nelement in constant time.\n\n    push(x) -- Push element x onto stack.\n    pop() -- Removes the element on top of the stack.\n    top() -- Get the top element.\n    getMin() -- Retrieve the minimum element in the stack.","distinct":true,"url":"https://api.github.com/repos/tianmn2109/leetcode/commits/3f165790d81e956de4c65241dd892d57c31dd315"}]}