oj
canglingye
这个作者很懒,什么都没留下…
展开
-
题目1012:畅通工程
题目描述: 某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?解决: 此题即为并查集的简单应用之一。直接贴代码,在关键之处都有详细注释#include using namespace原创 2014-03-31 20:15:25 · 699 阅读 · 0 评论 -
LeetCode——H-Index
LeetCode——H-Index解法原创 2015-09-04 10:05:45 · 4391 阅读 · 0 评论 -
LeetCode——First Bad Version
题目描述: 现有从n个版本产品,由于第x个版本发生错误,导致x版本以及之后的所有版本都发生错误。请找出x版本的位置 解法: 比较明显的二分解题方法,二分查找即可。 但是,在确定中间位置时,请使用: int middle = start + (end - start)/2; (1) 而原创 2015-09-08 10:17:12 · 728 阅读 · 0 评论 -
LeetCode——House Robber
题目描述 LeetCode - House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed.原创 2015-04-03 11:39:48 · 2114 阅读 · 0 评论 -
LeetCode-Number of 1 Bits
问题描述Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 000000000原创 2015-03-10 16:49:19 · 6920 阅读 · 5 评论 -
LeetCode-Longest Substring Without Repeating Characters
题目描述Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. F原创 2015-03-05 10:39:14 · 444 阅读 · 0 评论 -
LeetCode-Best Time to Buy and Sell Stock III
题目描述Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note: You may not e原创 2015-03-02 09:47:38 · 469 阅读 · 0 评论 -
LeetCode-Sort Colors
Sort Colors题目描述Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the原创 2015-03-03 09:54:27 · 395 阅读 · 0 评论 -
LeetCode——Repeated DNA Sequences
题目描述:All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the原创 2015-02-09 13:40:26 · 1813 阅读 · 2 评论 -
LeetCode-Sort List
LeetCode-Sort List题目描述如下: Sort a linked list in O(n log n) time using constant space complexity. 解题思路: 即找一个时间复杂度为O(nlogn)的基于链表的排序算法,那么,只有归并排序符合要求。快速排序之类的排序算法都需要随机访问能力,链表不符合要求。 然后按照一般的递归归并排序来看,其要占用O原创 2015-02-18 12:56:15 · 491 阅读 · 0 评论 -
LeetCode——Perfect Squares
题目描述:将数字n,分解成k个平方数之和。如12 = 4 + 4 + 4,13 = 9 + 4。求k的最小值。 题目解法:初读题目,发现如果n本身就是平方数最完美不过了,这样直接求得k = 1。但是事情并不是这样。比如13,其平方根为3.6左右,不是平方数。那么,先尝试将其分为 9(3的平方) + 4 ,然后再尝试对4进行分解,发现4恰巧是完全平方数,则13结果为 9原创 2015-09-11 10:25:42 · 623 阅读 · 0 评论