leetcode---word-search---dfs

Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where “adj...

2017-09-29 20:05:26

阅读数:112

评论数:0

leetcode---combinations---dfs

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]...

2017-09-29 19:18:00

阅读数:93

评论数:0

leetcode---set-matrix-zeroes---查找

题目描述 Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. Follow up: Did you us...

2017-09-29 18:56:10

阅读数:70

评论数:0

ceres---cannot convert ‘const ceres::Jet<double, 6>’ to ‘double’

报错error: conversion from ‘int’ to non-scalar type ‘ceres::Jet<double, 6>’ requested T err = 0;解决:T err = T(0);报错 error: cannot convert ‘cons...

2017-09-29 13:50:17

阅读数:465

评论数:0

linux---eigen安装

sudo apt install libeigen3-devCMakeLists.txtfind_package(Eigen3 REQUIRED) include_directories( ${EIGEN3_INCLUDE_DIR} ${EIGEN3_LIBRARIES} )如果报错: ...

2017-09-28 17:27:44

阅读数:1526

评论数:0

leetcode---word-ladder---查找

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter...

2017-09-26 19:02:17

阅读数:116

评论数:0

leetcode---gas-station---贪心

There are N gas stations along a circular route, where the amount of gas at station i isgas[i]. You have a car with an unlimited gas tank and it cos...

2017-09-25 19:27:35

阅读数:76

评论数:0

leetcode---evaluate-reverse-polish-notation---栈

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another exp...

2017-09-24 15:37:44

阅读数:90

评论数:0

github命令

git diff 查看修改前后的区别 git status git add src/calib_node.cpp 添加src/calib_node.cpp git commit -m “rm imgshow” 提交修改原因”rm imgshow” git push o...

2017-09-24 14:59:50

阅读数:105

评论数:0

leetcode---powx-n---dfs

Implement pow(x, n).class Solution { public: double pow(double x, int n) { if(n == -2147483648) return 1.0/(x*pow(x, -n-...

2017-09-24 14:55:40

阅读数:82

评论数:0

leetcode---restore-ip-addresses---dfs

Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given”25525511135”, return...

2017-09-24 14:52:03

阅读数:74

评论数:0

openCV---旋转向量转旋转矩阵

Mat rvecs; // 旋转向量 Mat rotation_matrix = Mat(3, 3, CV_64FC1, Scalar::all(0)); // 图像的旋转矩阵 // 将旋转向量转换为相对应的旋转矩阵 */ Rodrigues(rvecs, rotation...

2017-09-23 15:39:49

阅读数:640

评论数:0

leetcode---permutations-ii---dfs

Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2]have the following unique...

2017-09-22 12:14:43

阅读数:66

评论数:0

leetcode---permutations---dfs

Given a collection of numbers, return all possible permutations. For example, [1,2,3]have the following permutations: [1,2,3],[1,3,2],[2,1,3],[2,3...

2017-09-22 12:02:27

阅读数:83

评论数:0

leetcode---sqrtx---分治

Implementint sqrt(int x). Compute and return the square root of x.class Solution { public: int sqrt(int x) { unsigned long long low...

2017-09-21 20:12:18

阅读数:87

评论数:0

leetcode---palindrome-partitioning-ii---dp

Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioni...

2017-09-20 14:15:04

阅读数:85

评论数:0

leetcode---scramble-string---dp

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representa...

2017-09-19 14:03:03

阅读数:200

评论数:0

leetcode---decode-ways--dp

A message containing letters fromA-Zis being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an enc...

2017-09-17 18:52:59

阅读数:102

评论数:0

leetcode---edit-distance---dp

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 hav...

2017-09-17 18:08:03

阅读数:92

评论数:0

leetcode---climbing-stairs---dp

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you ...

2017-09-17 17:50:47

阅读数:85

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭