[问题描述]Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioni...
分类：
其他好文 时间：
2014-10-07 01:23:32
阅读次数：
341
leetcode 经典题Minimum Window Substring ，很巧妙算法。...
Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo...
分类：
其他好文 时间：
2014-10-06 21:14:50
阅读次数：
220
划分树,统计每层移到左边的数的和.
Minimum Sum
Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2959 Accepted Submission(s): 684
Problem De...
分类：
其他好文 时间：
2014-10-06 20:37:00
阅读次数：
141
【leetcode】Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s....
分类：
其他好文 时间：
2014-10-06 12:12:00
阅读次数：
149
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODE...
[root@localhost ~]# vi /etc/squid/squid.conf## Recommended minimum configuration:#acl manager proto cache_objectacl localhost src 127.0.0.1/32 ::1acl ...
分类：
其他好文 时间：
2014-10-05 11:33:28
阅读次数：
257
You are given a list of cities. Each direct connection between two cities has its transportation cost (an integer bigger than 0). The goal is to find the paths of minimum cost between pairs of cities....
分类：
Web程序 时间：
2014-10-05 01:29:57
阅读次数：
289
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA...
Minimum Depth of Binary Tree
Total Accepted: 24760 Total
Submissions: 83665My Submissions
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the ...
分类：
其他好文 时间：
2014-10-04 12:50:06
阅读次数：
146
