{"push_id":709141872,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2d68a604e6c6a78bdd145e407b01a9bc449f18d2","before":"8abeeaa94f99f72d3886dbee225e4abc7c2d9d9f","commits":[{"sha":"2d68a604e6c6a78bdd145e407b01a9bc449f18d2","author":{"email":"55d05a871e807b3c21ca936e5bc34548950e3fdc@gmail.com","name":"Frank Zhao"},"message":"Solve backwash and memory problem\n\nThe backwash problem was solved by adding an extra weightedQuickUnionUF object with only N*N + 1 elements. The extra object does not include the bottom virtual node. When testing the isFull(), use the extra object instead of the original one. \r\n\r\nThe memory problem was solved by replacing int with boolean to store the open status of the cells.","distinct":true,"url":"https://api.github.com/repos/futurechao/Algorithm1_Princeton/commits/2d68a604e6c6a78bdd145e407b01a9bc449f18d2"}]}