Foobar: Please Pass the Coded Messages

0309

You need to pass a message to the bunny workers, but to avoid detection, the code you agreed to use is… obscure, to say the least. The bunnies are given food on standard-issue plates that are stamped with the numbers 0-9 for easier sorting, and you need to combine sets of plates to create the numbers in the code. The signal that a number is part of the code is that it is divisible by 3. You can do smaller numbers like 15 and 45 easily, but bigger numbers like 144 and 414 are a little trickier. Write a program to help yourself quickly create large numbers for use in the code, given a limited number of plates to work with.

You have L, a list containing some digits (0 to 9). Write a function solution(L) which finds the largest number that can be made from some or all of these digits and is divisible by 3. If it is not possible to make such a number, return 0 as the solution. L will contain anywhere from 1 to 9 digits. The same digit may appear multiple times in the list, but each element in the list may only be used once.

Languages

To provide a Java solution, edit Solution.java
To provide a Python solution, edit solution.py

Test cases

Your code should pass the following test cases.
Note that it may also be run against hidden test cases not shown here.

Input:
solution.solution([3, 1, 4, 1])
Output:
4311

Input:
solution.solution([3, 1, 4, 1, 5, 9])
Output:
94311

Solution:
python 

<span>def</span> <span>to_int</span><span>(</span><span>l</span><span>):</span>
    <span>if</span> <span>not</span> <span>l</span><span>:</span>
        <span>return</span> <span>0</span>
    <span>return</span> <span>int</span><span>(</span><span>""</span><span>.</span><span>join</span><span>([</span><span>str</span><span>(</span><span>d</span><span>)</span> <span>for</span> <span>d</span> <span>in</span> <span>l</span><span>]))</span>
<span>def</span> <span>solution</span><span>(</span><span>l</span><span>):</span>
    <span>l</span> <span>=</span> <span>sorted</span><span>(</span><span>l</span><span>,</span> <span>reverse</span><span>=</span><span>True</span><span>)</span>
    <span>n</span> <span>=</span> <span>len</span><span>(</span><span>l</span><span>)</span>
    <span>s</span> <span>=</span> <span>sum</span><span>(</span><span>l</span><span>)</span>
    <span>if</span> <span>s</span> <span>%</span> <span>3</span> <span>==</span> <span>0</span><span>:</span>
        <span># already divisible by 3 => use all digits </span>        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>)</span>
    <span>elif</span> <span>s</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
        <span># check backward if there is a digit that is 1 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span># there must be two digits that each of them is 2 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>break</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span>j</span> <span>=</span> <span>i</span> <span>-</span> <span>1</span>
        <span>while</span> <span>j</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>j</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>break</span>
            <span>j</span> <span>-=</span> <span>1</span>
        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>j</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>j</span><span>+</span><span>1</span><span>:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
    <span>else</span><span>:</span>
        <span># check backward if there is a digit that is 2 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span># there must be two digits that each of them is 1 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>break</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span>j</span> <span>=</span> <span>i</span> <span>-</span> <span>1</span>
        <span>while</span> <span>j</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>j</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>break</span>
            <span>j</span> <span>-=</span> <span>1</span>
        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>j</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>j</span><span>+</span><span>1</span><span>:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
<span>def</span> <span>to_int</span><span>(</span><span>l</span><span>):</span>
    <span>if</span> <span>not</span> <span>l</span><span>:</span>
        <span>return</span> <span>0</span>
    <span>return</span> <span>int</span><span>(</span><span>""</span><span>.</span><span>join</span><span>([</span><span>str</span><span>(</span><span>d</span><span>)</span> <span>for</span> <span>d</span> <span>in</span> <span>l</span><span>]))</span>

<span>def</span> <span>solution</span><span>(</span><span>l</span><span>):</span>
    <span>l</span> <span>=</span> <span>sorted</span><span>(</span><span>l</span><span>,</span> <span>reverse</span><span>=</span><span>True</span><span>)</span>
    <span>n</span> <span>=</span> <span>len</span><span>(</span><span>l</span><span>)</span>
    <span>s</span> <span>=</span> <span>sum</span><span>(</span><span>l</span><span>)</span>
    <span>if</span> <span>s</span> <span>%</span> <span>3</span> <span>==</span> <span>0</span><span>:</span>
        <span># already divisible by 3 => use all digits </span>        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>)</span>
    <span>elif</span> <span>s</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
        <span># check backward if there is a digit that is 1 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span># there must be two digits that each of them is 2 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>break</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span>j</span> <span>=</span> <span>i</span> <span>-</span> <span>1</span>
        <span>while</span> <span>j</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>j</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>break</span>
            <span>j</span> <span>-=</span> <span>1</span>
        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>j</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>j</span><span>+</span><span>1</span><span>:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
    <span>else</span><span>:</span>
        <span># check backward if there is a digit that is 2 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>2</span><span>:</span>
                <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span># there must be two digits that each of them is 1 mod 3 </span>        <span>i</span> <span>=</span> <span>n</span> <span>-</span> <span>1</span>
        <span>while</span> <span>i</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>i</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>break</span>
            <span>i</span> <span>-=</span> <span>1</span>
        <span>j</span> <span>=</span> <span>i</span> <span>-</span> <span>1</span>
        <span>while</span> <span>j</span> <span>>=</span> <span>0</span><span>:</span>
            <span>if</span> <span>l</span><span>[</span><span>j</span><span>]</span> <span>%</span> <span>3</span> <span>==</span> <span>1</span><span>:</span>
                <span>break</span>
            <span>j</span> <span>-=</span> <span>1</span>
        <span>return</span> <span>to_int</span><span>(</span><span>l</span><span>[:</span><span>j</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>j</span><span>+</span><span>1</span><span>:</span><span>i</span><span>]</span> <span>+</span> <span>l</span><span>[</span><span>i</span><span>+</span><span>1</span><span>:])</span>
def to_int(l):
    if not l:
        return 0
    return int("".join([str(d) for d in l]))

def solution(l):
    l = sorted(l, reverse=True)
    n = len(l)
    s = sum(l)
    if s % 3 == 0:
        # already divisible by 3 => use all digits         return to_int(l)
    elif s % 3 == 1:
        # check backward if there is a digit that is 1 mod 3         i = n - 1
        while i >= 0:
            if l[i] % 3 == 1:
                return to_int(l[:i] + l[i+1:])
            i -= 1
        # there must be two digits that each of them is 2 mod 3         i = n - 1
        while i >= 0:
            if l[i] % 3 == 2:
                break
            i -= 1
        j = i - 1
        while j >= 0:
            if l[j] % 3 == 2:
                break
            j -= 1
        return to_int(l[:j] + l[j+1:i] + l[i+1:])
    else:
        # check backward if there is a digit that is 2 mod 3         i = n - 1
        while i >= 0:
            if l[i] % 3 == 2:
                return to_int(l[:i] + l[i+1:])
            i -= 1
        # there must be two digits that each of them is 1 mod 3         i = n - 1
        while i >= 0:
            if l[i] % 3 == 1:
                break
            i -= 1
        j = i - 1
        while j >= 0:
            if l[j] % 3 == 1:
                break
            j -= 1
        return to_int(l[:j] + l[j+1:i] + l[i+1:])

Enter fullscreen mode Exit fullscreen mode

原文链接：Foobar: Please Pass the Coded Messages

展开阅读全文
© 版权声明
文章版权声明 1、本网站名称：拾光赋
2、本站永久网址：https://www.blogs.ink
3、本网站的文章部分内容可能来源于网络，仅供大家学习与参考，如有侵权，请联系站长QQ：805375623进行删除处理。
4、本站一切资源不代表本站立场，并不代表本站赞同其观点和对其真实性负责。
5、本站一律禁止以任何方式发布或转载任何违法的相关信息，访客发现请向站长举报
6、本站资源大多存储在云盘，如发现链接失效，请联系我们我们会第一时间更新。

THE END
Python（EN）
# python# google# foobar
喜欢就支持一下吧
点赞9 分享
anything that adds laughter and joy to your life.
不要延迟任何可以给你的生活带来欢笑与快乐的事情
kity的头像-拾光赋
相关推荐
评论 抢沙发

请登录后发表评论

    暂无评论内容

kity的头像-拾光赋
今日剩余 50.9%
本周剩余 35.8%
本月剩余 33.9%
本年剩余 78.2%
最近评论
Vito的头像-拾光赋

Vito5个月前2

你就是我心中的那首忐忑，总是让我惊心动魄
Jason.Meng的头像-拾光赋钻石会员

Jason.Meng徽章-人气大使-拾光赋5个月前2

总是会在人生的不同阶段反复爱上大佬的文章~
每日一言
The questions you ask determine the quality of your life.
你生活的品质取决于你所提出的问题