摘要：
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear twi 阅读全文
posted @ 2017-02-15 14:51
CodesKiller
阅读(146)
评论(0)
推荐(0)
摘要：
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] 阅读全文
posted @ 2017-02-15 14:34
CodesKiller
阅读(134)
评论(0)
推荐(0)
摘要：
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-02-15 14:09
CodesKiller
阅读(132)
评论(0)
推荐(0)
摘要：
Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library functio 阅读全文
posted @ 2017-02-15 13:38
CodesKiller
阅读(170)
评论(0)
推荐(0)
摘要：
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: 阅读全文
posted @ 2017-02-15 13:25
CodesKiller
阅读(121)
评论(0)
推荐(0)
浙公网安备 33010602011771号