2015年4月14日
【leetcode】Text Justification（hard) ☆
摘要： Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) justified.You should p... 阅读全文
posted @ 2015-04-14 18:54 匡子语 阅读(240) 评论(0) 推荐(0)
【leetcode】Path Sum I & II（middle）
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2015-04-14 09:58 匡子语 阅读(243) 评论(0) 推荐(0)