首页 > 其他 > 详细

Problem Single Number II

时间:2014-07-07 16:09:07      阅读:257      评论:0      收藏:0      [点我收藏+]

Problem Description:

Given an array of integers, every element appears three times except for one. Find that single one.

Solution:

1          Arrays.sort(A);
2         for (int i = 2; i < A.length; i += 3) {
3             if (A[i] != A[i-2]) {
4                 return A[i-2];
5             }
6         }
7 
8         return A[A.length - 1];

 

Problem Single Number II,布布扣,bubuko.com

Problem Single Number II

原文:http://www.cnblogs.com/liew/p/3815080.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!