摘要: The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return al 阅读全文
posted @ 2015-03-30 13:18 Grandyang 阅读(23479) 评论(3) 推荐(0) 编辑
摘要: Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Ex 阅读全文
posted @ 2015-03-30 09:20 Grandyang 阅读(43222) 评论(11) 推荐(1) 编辑
Fork me on GitHub