zoukankan      html  css  js  c++  java
  • Find the largest multiple of 3 解答

    Question

    Given an array of non-negative integers. Find the largest multiple of 3 that can be formed from array elements.

    For example, if the input array is {8, 1, 9}, the output should be “9 8 1″, and if the input array is {8, 1, 7, 6, 0}, output should be “8 7 6 0″.

    Solution

    A number is multiple of 3 if and only if the sum of digits of number is multiple of 3.

    1. Sort the array in non-decreasing order.
    
    2. Take three queues. One for storing elements which on dividing by 3 gives remainder as 0.The second queue stores digits which on dividing by 3 gives remainder as 1. The third queue stores digits which on dividing by 3 gives remainder as 2. Call them as queue0, queue1 and queue2
    
    3. Find the sum of all the digits.
    
    4. Three cases arise:
    ……4.1 The sum of digits is divisible by 3. Dequeue all the digits from the three queues. Sort them in non-increasing order. Output the array.
    
    ……4.2 The sum of digits produces remainder 1 when divided by 3.
    Remove one item from queue1. If queue1 is empty, remove two items from queue2. If queue2 contains less than two items, the number is not possible.
    
    ……4.3 The sum of digits produces remainder 2 when divided by 3.
    Remove one item from queue2. If queue2 is empty, remove two items from queue1. If queue1 contains less than two items, the number is not possible.
    
    5. Finally empty all the queues into an auxiliary array. Sort the auxiliary array in non-increasing order. Output the auxiliary array.
  • 相关阅读:
    ubuntu14.04显卡驱动问题(amd5600k集显7650d)
    win7 ubuntu 14.04双系统安装
    func_num_args, func_get_arg, func_get-args 的区别与用法
    wamp2.5版本64位403forbidden问题
    mysql根据汉字拼音排序查询
    php判断浏览器语言
    php批量下载文件
    php搜索分页
    把ZenCart在线商店搭建到本地
    livezilla账号或密码修改方法
  • 原文地址:https://www.cnblogs.com/ireneyanglan/p/4908150.html
Copyright © 2011-2022 走看看