摘要: 1. palindrome-partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome pa 阅读全文
posted @ 2016-03-30 11:25 zxqstrong 阅读(325) 评论(0) 推荐(0) 编辑
摘要: 1. single-number Given an array of integers, every element appears twice except for one. Find that single one. Note:Your algorithm should have a linea 阅读全文
posted @ 2016-03-30 09:50 zxqstrong 阅读(246) 评论(0) 推荐(0) 编辑