2014年3月16日
找到单独的数字 Single Number
摘要： Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?class Solution{ int FindSingleNumber(int num[], int n) { if(NULL == num || n <= 0) ... 阅读全文
posted @ 2014-03-16 13:10 JasonScor 阅读(220) 评论(0) 推荐(0)