as1490047935的博客

原创 DSP-SLAM运行代码

编译并运行DSP-SLAM的全过程，数据集是真的难下，不过幸好运行成功了tips:安装pangolin0.7版本 eigen 3.4.0cd DSP-SLAM/#opencv安装cmake -DCMAKE_BUILD_TYPE=Release -DWITH_CUDA=OFF -DBUILD_DOCS=OFF -DBUILD_PACKAGE=OFF -DBUILD_TESTS=OFF -DBUILD_PERF_TESTS=O

原创 近期学习的内容

以前跑程序总卡住，原来是以前只分配了4g内存，编译obslam只要make -j8就会卡住，现在扩容到了24g应该不会卡了吧 sudo dd if=/dev/zero of=swapfile bs=1073741824 count=16sudo swapon swapfilesudo swapon swapfile

原创 【Mask R-CNN ubuntu安装教程及识别人物去检测框】

这位大佬的有用，适合python3.7+cuda10.1/2+cudnn7.6.5+tensorflow2.2.0提取图片很耐思，适合小白

原创 ROS使用python3环境

https://www.jianshu.com/p/2f86607c98d1http://www.soolco.com/post/29527_1_1.html

原创 ORB-SLAM3运行

./Examples/Stereo/stereo_kitti Vocabulary/ORBvoc.txt Examples/Stereo/KITTI00-02.yaml /media/xcc/TOSHIBA\ EXT/data/KITTI/data_odometry_gray/dataset/sequences/00

原创 opencv34安装和卸载

cmake -D CMAKE_INSTALL_PREFIX=/usr/local/opencv-4.4.0 -D CMAKE_BUILD_TYPE=Release -D OPENCV_GENERATE_PKGCONFIG=YES -D OPENCV_EXTRA_MODULES_PATH=../opencv_contrib-4.4.0/modules ..sudo vim /etc/profile.d/pkgconfig.shsource /etc/profilepkg-config --libs o

原创 软件测试题目

转载 238. 除自身以外数组的乘积

class Solution { public int[] productExceptSelf(int[] nums) { int length = nums.length; int[] answer = new int[length]; // answer[i] 表示索引 i 左侧所有元素的乘积 // 因为索引为 '0' 的元素左侧没有元素， 所以 answer[0] = 1 answer[0] = 1;

转载 236. 二叉树的最近公共祖先

class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if(root == null || root == p || root == q) return root; TreeNode left = lowestCommonAncestor(root.left, p, q); TreeNode right = lowes

转载 234. 回文链表

public boolean isPalindrome(ListNode head) { ListNode fast = head, slow = head; //通过快慢指针找到中点 while (fast != null && fast.next != null) { fast = fast.next.next; slow = slow.next; } //如果fast不为空，说明链表的长度是奇数个 if (

转载 221. 最大正方形

题解class Solution { public int maximalSquare(char[][] matrix) { int m = matrix.length , n = matrix[0].length , max = 0; int [][] dp = new int[m][n]; for(int i = 0 ; i < m ; i++){ for(int j = 0; j < n ;j++){ ..

转载 215. 数组中的第K个最大元素

选择排序 //selectSort 每次将当前元素替换为后面最小的元素 public static void selectSort(int[] a){ int N = a.length; for (int i = 0; i < N; i++) { int min = i; for (int j = i+1; j < N; j++) { if(a[j]<a[min]).

转载 208. 实现 Trie (前缀树)

题解比较详细的图解class TrieNode { // 节点 boolean isWord; TrieNode[] children = new TrieNode[26]; }class Trie { TrieNode root; // 根节点 public Trie() { root = new TrieNode(); // 构造字典树，就是先构造出一个空的根节点 } //【向字典树插入单词w..

原创 ROS配置SLAM环境

主要就是为了提取DS-SLAM的语义分割结果，据说是在segment.cc中修改。直接在segment.cc中imshow了半天也没出图片结果，好像是被ROS通信阻断了，索性把segment.cc的函数全搬来了放在ros_tum_realtime.cc中当然还是比较菜查找clion安装的路径locate clion.sh的sh /home/xcc/clion-2021.1.3/bin/clion.shCMake options-DCATKIN_DEVEL_PREFIX:PATH=/hom

原创 YOLOX安装指南

最近ubuntu系统跑几下就死机，怕了帕了，后面会把以前安装好的教程都发在csdn上。以免后面系统崩溃后又要重新装过而不知所措。前段时间yolov5横空出世，然后又多出来了各种比它好的yolo算法。本次安装的是yolox,，听说是旷视研发团队搞出来的。现在我们就来看看具体的安装步骤吧。安装系统ubuntu18.04cuda10.1cudnn7.6.5安装环境通通在anaconda环境下进行git clone https://github.com/Megvii-BaseDetection/YOLO

原创 cuda10.1与cuda10.2切换

查看openv版本号pkg-config --modversion opencvcuda间切换终端切换到/usr/local/下，sudo rm -rf /usr/local/cuda #删除之前生成的软链接sudo ln -s /usr/local/cuda-10.1 /usr/local/cuda #生成新的软链接cat /usr/local/cuda/version.txt#查看当前cuda的版本cudnn 切换配置命令如下：sudo cp cuda/include/cud

原创 rtabmap保存点云

rtabmap-databaseViewer ~/.ros/rtabmap.db

原创 下载的kitti数据集收到的答复

昨天想下载kitti数据集里面的语义分割数据集，好不容易进了网页，后面注册就算了，还要各种回答问题，今天受到的答复看来是下不了了。Unfortunately, your application could not be approved. Note that we cannot accept requests that do not provide a description of the method that is submitted or that do not provide a plan for

原创 卸载eigen3

sudo rm -rf /usr/local/include/eigen3sudo rm -rf /usr/local/include/Eigen/sudo rm -rf /usr/local/share/pkgconfig/eigen3.pc

原创 近期的一些进展

以前总被核心已转储困扰，经过在clion下的调试才发现是Pangolin的问题，卸载了安装最新版就好了。目前在跑数据集，在orbslam2上测试fr3/walking/xyz 跑的时候出现了跟踪丢失的现象(1) 评估TUM数据集以RGB-D数据集：rgbd_dataset_freiburg3_walking_xyz数据集为例绘制轨迹并对齐：evo_traj tum groundtruth.txt KeyFrameTrajectory.txt --ref KeyFrameTrajectory.

转载 课程表

方法一：入度表（广度优先遍历）class Solution { public boolean canFinish(int numCourses, int[][] prerequisites) { int[] indegrees = new int[numCourses]; List<List<Integer>> adjacency = new ArrayList<>(); Queue<Integer>.

转载 课程表

class Solution { public boolean canFinish(int numCourses, int[][] prerequisites) { int[] indegrees = new int[numCourses]; List<List<Integer>> adjacency = new ArrayList<>(); Queue<Integer> queue = new Lin.

转载 反转链表

方法一：迭代class Solution { public ListNode reverseList(ListNode head) { ListNode prev = null; ListNode curr = head; while (curr != null) { ListNode next = curr.next; curr.next = prev; prev = c...

转载 岛屿数量

class Solution { public int numIslands(char[][] grid) { int count = 0; for(int i = 0; i < grid.length; i++) { for(int j = 0; j < grid[0].length; j++) { if(grid[i][j] == '1'){ dfs(g..

转载 打家劫舍

class Solution { public int rob(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int length = nums.length; if (length == 1) { return nums[0]; } int[] dp = new int.

转载 多数元素

class Solution { public int majorityElement(int[] nums) { Map<Integer, Integer> counter = new HashMap<>(); // 遍历每个数统计次数 for (int num: nums) { counter.put(num, counter.getOrDefault(num, 0) + 1); .

转载 相交链表

题解public ListNode getIntersectionNode(ListNode headA, ListNode headB) { if (headA == null || headB == null) return null; ListNode pA = headA, pB = headB; while (pA != pB) { pA = pA == null ? headB : pA.next; pB = pB == nul...

转载 最小栈

题解解法一class MinStack { /** initialize your data structure here. */ private Stack<Integer> stack; private Stack<Integer> minStack; public MinStack() { stack = new Stack<>(); minStack = new Stack<>().

转载 乘积最大数组

题解解法一 动态规划public int maxProduct(int[] nums) { int n = nums.length; if (n == 0) { return 0; } int[] dpMax = new int[n]; dpMax[0] = nums[0]; int[] dpMin = new int[n]; dpMin[0] = nums[0]; int max = nums[0]; for .

转载 排序链表

题解递归/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next;

转载 LRU缓存机制

题解class LRUCache extends LinkedHashMap<Integer, Integer>{ private int capacity; public LRUCache(int capacity) { super(capacity, 0.75F, true); this.capacity = capacity; } public int get(int key) { retur..

转载 环形链表 II

Carl大神题解public class Solution { public ListNode detectCycle(ListNode head) { ListNode fast = head; ListNode slow = head; while(fast != null && fast.next != null) { slow = slow.next; fast = fas...

转载 环形链表

方法一：哈希表public class Solution { public boolean hasCycle(ListNode head) { Set<ListNode> seen = new HashSet<ListNode>(); while (head != null) { if (!seen.add(head)) { return true; } ..

转载 单词拆分

public class Solution { public boolean wordBreak(String s, List<String> wordDict) { Set<String> wordDictSet = new HashSet(wordDict); boolean[] dp = new boolean[s.length() + 1]; dp[0] = true; for (int i = 1; .

转载 只出现一次的数字

class Solution { public int singleNumber(int[] nums) { int single = 0; for (int num : nums) { single ^= num; } return single; }}

转载 最长连续序列

题解暴力解法class Solution { public int longestConsecutive(int[] nums) { if(nums.length==0||nums==null){ return 0; } Arrays.sort(nums); int len=nums.length; int count = 1; int res=0; for(.

转载 二叉树中的最大路径和

大佬题解/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { int res = Integer.MIN_VALUE; public int maxPathS...

转载 买卖股票的最佳时机

weiwei大佬题解方法一：暴力解法public class Solution { public int maxProfit(int[] prices) { int len = prices.length; if (len < 2) { return 0; } // 有可能不发生交易，因此结果集的初始值设置为 0 int res = 0; // 枚举所有发生一次交.

转载 二叉树展开为链表

题解public void flatten(TreeNode root) { while (root != null) { //左子树为 null，直接考虑下一个节点 if (root.left == null) { root = root.right; } else { // 找左子树最右边的节点 TreeNode pre = root.left; .

转载 从前序与中序遍历序列构造二叉树

weiwei大佬题解import javax.management.RuntimeErrorException;import java.util.HashMap;import java.util.Map;class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) {val = x;}}public class Solution { public TreeNode..