摘要:
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up 阅读全文
posted @ 2016-09-24 22:19
咖啡中不塌缩的方糖
阅读(133)
评论(0)
推荐(0)
摘要:
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum 阅读全文
posted @ 2016-09-24 11:22
咖啡中不塌缩的方糖
阅读(116)
评论(0)
推荐(0)
摘要:
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every 阅读全文
posted @ 2016-09-24 09:31
咖啡中不塌缩的方糖
阅读(118)
评论(0)
推荐(0)
摘要:
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文
posted @ 2016-09-24 05:49
咖啡中不塌缩的方糖
阅读(134)
评论(0)
推荐(0)
摘要:
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文
posted @ 2016-09-24 05:02
咖啡中不塌缩的方糖
阅读(111)
评论(0)
推荐(0)

浙公网安备 33010602011771号