码迷,mamicode.com
首页 >  
搜索关键字:to the gcc binary    ( 19550个结果
Add Binary
Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".classSolution{public:stringaddBinary(stringa,st...
分类:其他好文   时间:2014-06-04 19:23:09    阅读次数:235
-ffunction-sections -Wl,--gc-sections
AVR/GCC设置不链接未调用的函数 http://blog.csdn.net/shevsten/article/details/7049688在AVR Studio4/5的AVR/GCC默认设置下,未调用的函数也会被link进最终的镜像,从而增大image的大小,这会浪费flash资源.以下是如....
分类:其他好文   时间:2014-06-04 18:59:56    阅读次数:840
Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number...
分类:其他好文   时间:2014-06-04 18:58:39    阅读次数:277
Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an...
分类:其他好文   时间:2014-06-04 18:37:18    阅读次数:277
pcre库编写的正则匹配程序
使用的是Philip Hazel的Perl-Compatible Regular Expression库,参考:http://see.xidian.edu.cn/cpp/html/1428.html执行匹配的时:gcc myreg.cip.pat 内容:ip.*[0-9]+\.[0-9]+\.[0-...
分类:其他好文   时间:2014-06-03 14:07:42    阅读次数:473
Validate Binary Search Tree
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 only n...
分类:其他好文   时间:2014-06-03 14:00:56    阅读次数:281
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ...
分类:其他好文   时间:2014-06-03 13:53:21    阅读次数:309
READ TABLE ..... BINARY SEARCH问题
Read Table 的语法很多,这里说一种特殊情况,Read Table 中查询的时候对标准内表经常有一种二分优化查找,用Binary search的时候首先必须要有查询条件;但如果查询条件满足的项目不至一条时,这时得到的是这些数据中索引排在最前面的数据; 如: 001 0001 2010010....
分类:其他好文   时间:2014-06-03 12:06:45    阅读次数:224
Sum Root to Leaf Numbers
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类:其他好文   时间:2014-05-30 16:32:52    阅读次数:226
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil...
分类:其他好文   时间:2014-05-30 16:17:49    阅读次数:210
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!