buildroot - 2011.11 交叉编译器制作时，提示如下错误：
“You may have to install 'g++' on your build machine”
还提示：toolchain/dependencies/dependencies.sh 121 Error
.....
原来他没有检查出来，CXXCOMPILER_VERSION为空。方便起见，我直接输入命令：
c++ -v 2>&1 | sed -n '/^gcc version/p' | sed -e 's/^gcc vers...
分类：
系统相关 时间：
2014-11-09 20:55:17
阅读次数：
568
Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express...
分类：
其他好文 时间：
2014-11-09 20:44:22
阅读次数：
204
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类：
其他好文 时间：
2014-11-09 19:30:15
阅读次数：
143
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol...
分类：
其他好文 时间：
2014-11-09 13:54:18
阅读次数：
155
同样的雪花时间限制：1000ms | 内存限制：65535KB难度：4描写叙述You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this ...
分类：
其他好文 时间：
2014-11-08 20:48:27
阅读次数：
139
Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that i...
分类：
其他好文 时间：
2014-11-08 16:28:21
阅读次数：
191
Given a string and a positive integer d. Some characters may be repeated in the given string. Rearrange characters of the given string such that the s...
分类：
其他好文 时间：
2014-11-08 16:27:57
阅读次数：
186
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo...
分类：
其他好文 时间：
2014-11-08 09:15:14
阅读次数：
187
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree. For example:Given the below binary tree, 1 ...
分类：
其他好文 时间：
2014-11-08 08:11:54
阅读次数：
244
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类：
其他好文 时间：
2014-11-08 00:46:40
阅读次数：
131
