2018年1月11日

Palindrome Partitioning

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文

posted @ 2018-01-11 16:18 夜的第八章 阅读(108) 评论(0) 推荐(0)

triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文

posted @ 2018-01-11 14:58 夜的第八章 阅读(150) 评论(0) 推荐(0)

Populating Next Right Pointers in Each Node(I and II)

摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne 阅读全文

posted @ 2018-01-11 10:10 夜的第八章 阅读(100) 评论(0) 推荐(0)

导航