摘要:
Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe... 阅读全文
摘要:
Problem Description:Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not alloca... 阅读全文
摘要:
将"Cocos2d-x 精灵碰撞检測(方法一)" update函数改动一下。使用精灵boundingBox函数获取直接精灵边界框, 不用自己计算精灵矩形大小了,还比較精确,然后调用intersectsRect计算2个精灵矩形是否存在交集。代码:void HelloWorld::update(floa... 阅读全文