摘要: Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,... 阅读全文
posted @ 2015-09-06 20:17 尾巴草 阅读(126) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which... 阅读全文
posted @ 2015-09-06 19:51 尾巴草 阅读(130) 评论(0) 推荐(0) 编辑
摘要: ProblemGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partit... 阅读全文
posted @ 2015-09-06 19:31 尾巴草 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 1 阅读全文
posted @ 2015-09-06 15:14 尾巴草 阅读(238) 评论(0) 推荐(0) 编辑
摘要: CartItemDao 1 //查询某个用户的某本图书的购物车条目是否存在 2 public CartItem findByUidAndBid(String uid,String bid) throws SQLException 3 { 4 String sql="s... 阅读全文
posted @ 2015-09-06 12:06 尾巴草 阅读(393) 评论(0) 推荐(0) 编辑