05 2017 档案

摘要:题目: Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest 阅读全文
posted @ 2017-05-31 14:37 MT.Queen 阅读(445) 评论(0) 推荐(0)
摘要:题目: You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both t 阅读全文
posted @ 2017-05-19 11:19 MT.Queen 阅读(167) 评论(0) 推荐(0)
摘要:原题目: A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determ 阅读全文
posted @ 2017-05-14 23:09 MT.Queen 阅读(150) 评论(0) 推荐(0)
摘要:Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 阅读全文
posted @ 2017-05-08 16:46 MT.Queen 阅读(129) 评论(0) 推荐(0)
摘要:最近在做实验的时候,需要配置SVO,下面讲讲其中的过程以及遇到的问题: 首先说明配置环境:Ubuntu 14.04 + ROS indigo,ROS的安装我参考了ROS的官网上给出的教程:http://wiki.ros.org/indigo/Installation/Ubuntu 安装一气呵成,中途 阅读全文
posted @ 2017-05-04 16:39 MT.Queen 阅读(2002) 评论(0) 推荐(0)

点击右上角即可分享
微信分享提示