vincentCheungM-CSDN博客

原创 Interview Sum Up

TP：应用软件开发岗主要问了网络协议以及安卓方面的内容； 1.TCP/UDP在网络的哪层 2.安卓activity相关的内容 3.安卓版本变化 CMB Network Technology 1.面向对象的特性：继承封装多态 2.多态的类型：没答出来；应该是编译时（静态）多态，以及运行时多态运行时多态主要是指父类指针与子类对象的运行时绑定，重载虚函数能进行动态绑定。而重载则属于编译时多态，这些

2017-09-29 09:52:30 198

原创 ZSBK

#include <iostream> #include <string>using namespace std;class Data{ public: string num; Data(int n){ num = to_string(n); } static Data minus(Data a, Data b){ int n

2017-09-27 14:29:39 294

原创激光雷达点云投影

3D激光雷达与2D图片投影激光雷达与投影坐标关系3D激光雷达向2D图片进行投影主要包括，BV：鸟瞰图，FV：正视图。两种方式都需要考虑图片坐标与激光雷达坐标间的对应关系，其关系如下图所示。坐标间对应关系图片坐标，横向为X轴，纵向为Y轴激光雷达坐标，雷达正前方为X轴正方向，左侧为Y轴正方向，垂直向上Z轴正方向正视图坐标对应关系正视图坐标对应关系其他投影约束 image中的x,y轴坐

2017-07-12 10:51:49 7556 3

在计算机算法求解问题当中，经常用时间复杂度和空间复杂度来表示一个算法的运行效率。空间复杂度表示一个算法在计算过程当中要占用的内存空间大小；时间复杂度则表示这个算法运行得到想要的解所需的计算工作量，并不是表示一个程序解决问题需要花多少时间，而是当问题规模扩大后，程序需要的时间长度增长得有多快，即探讨的是当输入值接近无穷时，算法所需工作量的变化快慢程度。也就是说，对于高速处理数据的计算机来说，处理某一

2017-07-05 11:21:14 2247

原创 Leetcode 77. Combinations

Leetcode 77. Combinationssource url题目描述Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example, If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3

2017-06-10 18:44:44 195

原创 Leetcode 98. Validate Binary Search Tree

Leetcode 98. Validate Binary Search Treesource url题目描述Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains on

2017-06-06 09:57:16 242

原创 Leetcode 215. Kth Largest Element in an Array

Leetcode 215. Kth Largest Element in an Arraysource url题目描述Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

2017-06-03 12:01:25 185

原创 Leetcode 113. Path Sum II

Leetcode 113. Path Sum IIsource url题目描述Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binary tree and sum = 22,

2017-05-31 11:59:44 227

原创 Leetcode 239. Sliding Window Maximum

Leetcode 239. Sliding Window Maximumsource url题目描述Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numb

2017-05-16 10:09:54 233

原创 Leetcode 236. Lowest Common Ancestor of a Binary Tree

Leetcode 236. Lowest Common Ancestor of a Binary Treesource url题目描述Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipe

2017-05-13 09:36:27 269

原创 Leetcode 523. Continuous Subarray Sum

Leetcode 523. Continuous Subarray Sumsource url题目描述Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that

2017-05-07 11:00:45 294

原创 Leetcode 152. Maximum Product Subarray

Leetcode 152. Maximum Product Subarraysource url题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,

2017-04-29 08:21:55 239

原创 Leetcode 322. Coin Change

Leetcode 322. Coin Changesource url题目描述 You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make

2017-04-28 17:49:09 222

原创 Leetcode 91. Decode Ways

Leetcode 91. Decode Wayssource url题目描述 A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encoded

2017-04-23 10:37:14 306

原创 Leetcode 72. Edit Distance

Leetcode 72. Edit Distancesource url题目描述 Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the f

2017-04-14 20:34:04 220

原创 Leetcode 300. Longest Increasing Subsequence

Leetcode 300. Longest Increasing Subsequencesource url题目描述 Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18

2017-04-08 16:50:45 275

原创 Leetcode 435. Non-overlapping Intervals

Leetcode 435. Non-overlapping Intervalssource url题目描述 Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

2017-04-01 12:42:22 303

原创 Leetcode 455. Assign Cookies

Leetcode 455. Assign Cookiessource url题目描述 Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed f

2017-03-25 15:30:19 172

原创 Leetcode 406. Queue Reconstruction by Height

Leetcode 406. Queue Reconstruction by Heightsource url题目描述 Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height o

2017-03-25 14:36:46 172

原创 Leetcode 513. Find Bottom Left Tree Value

Leetcode 513. Find Bottom Left Tree Valuesource url题目描述 Given a binary tree, find the leftmost value in the last row of the tree. 输入：二叉树输出：最底层的第一片叶子如：Input: 2 / \ 1 3Output: 1Input:

2017-03-18 10:20:41 200

原创 Leetcode 207. Course Schedule

Leetcode 207. Course Schedulesource url题目描述 There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to

2017-03-12 11:24:59 234

原创 Leetcode 241. Different Ways to Add Parentheses

Leetcode 53.Maximum Subarray

2017-03-04 11:32:03 233

原创 Leetcode 53.Maximum Subarray

Leetcode 53.Maximum Subarraysource url题目描述输入：一个数组输出：该数组中，最大连续子序列和如：Input:[-2,1,-3,4,-1,2,1,-5,4] Output:6 //[4,-1,2,1]代码int max = 0;//for saving the max sum of sub array bool init = false;//recursi

2017-02-25 17:17:42 216

vincent_cheung