100DaysOfPython (100 Part Series)

Today is my day 57th of #100dayofcode and #python. Today also continued to learned more properties of SQL including INNER JOIN,LEFT JOIN, RIGHT JOIN, FULL JOIN, IS LIKE, NOT LIKE, IS NULL, IS NOT NULL etc from Datacamp

Also tried to complete some assignment in coursera regarding to the topic algorithmic toolbox. I tired to solve money change problems, Fractional Knapsack problems, car fueling problem.

Python code

We are going to change Rs.28. In the shop shopkeeper has only Rs.1, Rs.5, Rs.10 as a change. So, possible change for 28 are 10,10,5,1,1,1. For this I tried to write following code.


<span>number</span> <span>=</span> <span>28</span>
<span>valid_changes</span> <span>=</span> <span>[</span><span>1</span><span>,</span> <span>5</span><span>,</span> <span>10</span><span>]</span>
<span>rem</span> <span>=</span> <span>number</span>
<span>changes</span><span>=</span><span>[]</span>
<span>while</span> <span>rem</span><span>!=</span><span>0</span><span>:</span>
<span># print(rem) </span>    <span>if</span> <span>rem</span><span>%</span><span>valid_changes</span><span>[</span><span>2</span><span>]</span><span>==</span><span>0</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>valid_changes</span><span>[</span><span>2</span><span>]])</span>
        <span>rem</span> <span>-=</span> <span>valid_changes</span><span>[</span><span>2</span><span>]</span>
    <span>elif</span> <span>rem</span><span>%</span><span>valid_changes</span><span>[</span><span>1</span><span>]</span><span>==</span><span>0</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>valid_changes</span><span>[</span><span>1</span><span>]])</span>
        <span>rem</span> <span>-=</span> <span>valid_changes</span><span>[</span><span>1</span><span>]</span>
    <span>else</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>1</span><span>])</span>
        <span>rem</span><span>-=</span><span>1</span>
<span>print</span><span>(</span><span>len</span><span>(</span><span>changes</span><span>))</span>
<span>number</span> <span>=</span> <span>28</span>
<span>valid_changes</span> <span>=</span> <span>[</span><span>1</span><span>,</span> <span>5</span><span>,</span> <span>10</span><span>]</span>
<span>rem</span> <span>=</span> <span>number</span>
<span>changes</span><span>=</span><span>[]</span>

<span>while</span> <span>rem</span><span>!=</span><span>0</span><span>:</span>
<span># print(rem) </span>    <span>if</span> <span>rem</span><span>%</span><span>valid_changes</span><span>[</span><span>2</span><span>]</span><span>==</span><span>0</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>valid_changes</span><span>[</span><span>2</span><span>]])</span>
        <span>rem</span> <span>-=</span> <span>valid_changes</span><span>[</span><span>2</span><span>]</span>
    <span>elif</span> <span>rem</span><span>%</span><span>valid_changes</span><span>[</span><span>1</span><span>]</span><span>==</span><span>0</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>valid_changes</span><span>[</span><span>1</span><span>]])</span>
        <span>rem</span> <span>-=</span> <span>valid_changes</span><span>[</span><span>1</span><span>]</span>
    <span>else</span><span>:</span>
        <span>changes</span><span>.</span><span>extend</span><span>([</span><span>1</span><span>])</span>
        <span>rem</span><span>-=</span><span>1</span>
<span>print</span><span>(</span><span>len</span><span>(</span><span>changes</span><span>))</span>
number = 28
valid_changes = [1, 5, 10]
rem = number
changes=[]

while rem!=0:
# print(rem)     if rem%valid_changes[2]==0:
        changes.extend([valid_changes[2]])
        rem -= valid_changes[2]
    elif rem%valid_changes[1]==0:
        changes.extend([valid_changes[1]])
        rem -= valid_changes[1]
    else:
        changes.extend([1])
        rem-=1
print(len(changes))

Enter fullscreen mode Exit fullscreen mode

When above code is run we get,


<span>28</span>
<span>27</span>
<span>26</span>
<span>25</span>
<span>20</span>
<span>10</span>
<span>[</span><span>1</span><span>,</span> <span>1</span><span>,</span> <span>1</span><span>,</span> <span>5</span><span>,</span> <span>10</span><span>,</span> <span>10</span><span>]</span>
<span>28</span>
<span>27</span>
<span>26</span>
<span>25</span>
<span>20</span>
<span>10</span>
<span>[</span><span>1</span><span>,</span> <span>1</span><span>,</span> <span>1</span><span>,</span> <span>5</span><span>,</span> <span>10</span><span>,</span> <span>10</span><span>]</span>
28
27
26
25
20
10
[1, 1, 1, 5, 10, 10]

Enter fullscreen mode Exit fullscreen mode

Day 57 Of #100DaysOfCode
* More properties of SQL(LEFT JOIN, RIGHT JOIN, FULL JOIN, INNER JOIN)
* More About Algorithm
* Code For Money Change#WomenWhoCode #teachertwitter #DEVCommunity pic.twitter.com/1zuUa1nQ6M

— Durga Pokharel (@mathdurga)
February 23, 2021

100DaysOfPython (100 Part Series)

原文链接：Day 57 Of 100DaysOfCode: Money Change Problem

展开阅读全文

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

THE END