Prevailing Wage等了3个月还没消息，急啊！# EB23 - 劳工卡
x*0
1 楼
下面是这道题的链接：
http://leetcode.com/onlinejudge#question_95
下面是我的代码：
class Solution {
private:
vector helper(int start, int end) {
if (start > end) {
return vector(1, NULL);
}
vector result;
for (int i = start; i <= end; ++i) {
vector left = helper(start, i-1);
vector right = helper(i+1, end);
for (int m = 0; m < left.size(); ++m) {
for (int n = 0; n < right.size(); ++n) {
TreeNode *root = new TreeNode(i);
root->left = left[m];
root->right = right[n];
result.push_back(root);
}
}
}
return result;
}
public:
vector generateTrees(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return helper(1, n);
}
};
leetcode 给出编译错误：
/usr/gcc_4_7/lib/gcc/i686-pc-linux-gnu/4.7.2/../../../../include/c++/4.7.2/
bits/stl_vector.h:1137:4: error: invalid conversion from 'int' to 'std::
vector::value_type {aka TreeNode*}' [-fpermissive]
在我自己的IDE上完全没有问题，Dev c++， 使用GCC 4.7.1 64-bit
大家帮忙看看这是什么原因
http://leetcode.com/onlinejudge#question_95
下面是我的代码：
class Solution {
private:
vector
if (start > end) {
return vector
}
vector
for (int i = start; i <= end; ++i) {
vector
vector
for (int m = 0; m < left.size(); ++m) {
for (int n = 0; n < right.size(); ++n) {
TreeNode *root = new TreeNode(i);
root->left = left[m];
root->right = right[n];
result.push_back(root);
}
}
}
return result;
}
public:
vector
// Start typing your C/C++ solution below
// DO NOT write int main() function
return helper(1, n);
}
};
leetcode 给出编译错误：
/usr/gcc_4_7/lib/gcc/i686-pc-linux-gnu/4.7.2/../../../../include/c++/4.7.2/
bits/stl_vector.h:1137:4: error: invalid conversion from 'int' to 'std::
vector
在我自己的IDE上完全没有问题，Dev c++， 使用GCC 4.7.1 64-bit
大家帮忙看看这是什么原因
