bangshu0671的博客

题目：证明：　　很容易将最小顶点覆盖归约到HITTINGSET。假设要求图G的最小顶点覆盖，可以建立一个HITTINGSET实例，其中 S1,S2,S3,...,Sn 即是图G的各条边，比如{v1,v2},{v3,v4},... 。通过二分式的询问，可以找到一个与 Si都相交的最小集合H，这正好就是图G的最小顶点覆盖。 转载于:https:/...

题目：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie...

题目：107. Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root)....

111. Minimum Depth of Binary Tree问题描述：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest lea...

题目：108. Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.题目分析：刚开始拿到这个题目的时候，以为只要按照顺序构建一个二叉树就可以了。但是后来...

记录一下整个相机的标定矫正过程，希望能够帮助到刚学习标定的童鞋们～首先下载matlab calibration toolbox，百度搜索第一条就是了（http://www.vision.caltech.edu/bouguetj/calib_doc/）。下载到本地后，需要在MATLAB中更改主路径：Set Path->Add with Subfolders->选定你刚下...

题目：Given an array of strings, group anagrams together.（给定一个字符串数组，将他们根据anagram归类）样例：given:["eat", "tea", "tan", "ate", "nat", "bat"],Return:[["ate", "eat","tea"],["nat","tan"],["bat"...

题目：Given an array of integers, 1 ≤ a[i] ≤n(n= size of array), some elements appeartwiceand others appearonce.Find all the elements that appeartwicein this array.Could you do it with...

题目：Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this...

Write a program to find then-th ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example,1, 2, 3, 4, 5, 6, 8, 9, 10, 12is the sequence of the first...

原题目：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, de...

最近在做实验的时候，需要配置SVO，下面讲讲其中的过程以及遇到的问题： 首先说明配置环境：Ubuntu 14.04 + ROS indigo，ROS的安装我参考了ROS的官网上给出的教程：http://wiki.ros.org/indigo/Installation/Ubuntu 安装一气呵成，中途没有遇到问题 1. 通过github SVO 上的[wiki](https://githu...

Given an array of integers and an integerk, you need to find the total number of continuous subarrays whose sum equals tok.示例:Input: nums = [1,1,1], k = 2Output: 2Note:The lengt...

题目：Given a positive integern, break it into the sum ofat leasttwo positive integers and maximize the product of those integers. Return the maximum product you can get.示例：givenn= 2, re...

本周继续练习动态规划的相关题目。题目：In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator ofm0sandn1s...

本周选择了贪心算法类的题型加以巩固，在LeetCode中难度系数为Hard。题目：Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects...

本周课堂上学习的是动态规划，因此在LeetCode上找到相应的题进行练习。题目：Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.（给定一个字符串S，找到它的最长回文子序...

本周对链表操作进行了巩固题目：Given a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given{1,2,3,4}...

本周依旧是做与图论相关的题目，作为对图论知识的巩固。题目：279. Perfect SquaresGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n...

本周学习分治法，故特意挑选了相关习题巩固一下，并回顾一下分治法的思路题目：Kth Largest Element in an ArrayFind thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth...