Delete duplicates of a list whithout using using a secondary list












-5















I have an exercise for my homeworks where I need to write a program that takes a list of integers as input, and returns the same list without any duplicate numbers.
The first idea that came to my mind is a loop using another list to compare with the first one, but we are not allowed to use another list.






python







share|improve this question




















  • 1





    Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:11








  • 1





    Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

    – Helena Martins
    Nov 22 '18 at 17:13











  • Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

    – juanpa.arrivillaga
    Nov 22 '18 at 17:14











  • Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

    – Axel
    Nov 22 '18 at 18:16
















-5















I have an exercise for my homeworks where I need to write a program that takes a list of integers as input, and returns the same list without any duplicate numbers.
The first idea that came to my mind is a loop using another list to compare with the first one, but we are not allowed to use another list.






python







share|improve this question




















  • 1





    Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:11








  • 1





    Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

    – Helena Martins
    Nov 22 '18 at 17:13











  • Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

    – juanpa.arrivillaga
    Nov 22 '18 at 17:14











  • Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

    – Axel
    Nov 22 '18 at 18:16














-5












-5








-5








I have an exercise for my homeworks where I need to write a program that takes a list of integers as input, and returns the same list without any duplicate numbers.
The first idea that came to my mind is a loop using another list to compare with the first one, but we are not allowed to use another list.






python







share|improve this question
















I have an exercise for my homeworks where I need to write a program that takes a list of integers as input, and returns the same list without any duplicate numbers.
The first idea that came to my mind is a loop using another list to compare with the first one, but we are not allowed to use another list.






python




python






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 22 '18 at 19:29









Aravind Bhat K

274214




274214










asked Nov 22 '18 at 17:08









Axel Axel

1




1








  • 1





    Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:11








  • 1





    Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

    – Helena Martins
    Nov 22 '18 at 17:13











  • Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

    – juanpa.arrivillaga
    Nov 22 '18 at 17:14











  • Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

    – Axel
    Nov 22 '18 at 18:16














  • 1





    Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:11








  • 1





    Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

    – Helena Martins
    Nov 22 '18 at 17:13











  • Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

    – juanpa.arrivillaga
    Nov 22 '18 at 17:14











  • Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

    – Axel
    Nov 22 '18 at 18:16








1




1





Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

– juanpa.arrivillaga
Nov 22 '18 at 17:11







Well, if you are not allowed to use auxiliary storage, you are going to have to rely on mutator methods like .remove or del my_list[i] Try something then ask a question if you run into problems, providing your Minimal, Complete, and Verifiable example. Otherwise, this is too broad.

– juanpa.arrivillaga
Nov 22 '18 at 17:11






1




1





Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

– Helena Martins
Nov 22 '18 at 17:13





Hey! Welcome to StackOverflow. Right now, your question is kinda generic, since we have no idea of what you've tried so far. I highly recomend you post your attempts so far. Also, this can be useful for asking about homework: meta.stackoverflow.com/questions/334822/…

– Helena Martins
Nov 22 '18 at 17:13













Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

– juanpa.arrivillaga
Nov 22 '18 at 17:14





Note, your first instinct was on the right track, but generally you would use a set as auxilliary storage in this case, because then you can remove duplicate in linear time!

– juanpa.arrivillaga
Nov 22 '18 at 17:14













Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

– Axel
Nov 22 '18 at 18:16





Thank's for your answers, It finally worked perfectly with list(set()) . Pretty sure that's not what my teachers wanted me to do, since they always want us to use math with ugly loops instead of built-in fonctions (which is kinda stupid in my opinion) but anyway thank you!

– Axel
Nov 22 '18 at 18:16












2 Answers
2






active

oldest

votes


















-1














You can use set



s=['a', 'b', 'c', 'd', 'a']

s=list(set(s))

print(s)

>>> ['b', 'c', 'd', 'a']


Well, as for the comments, you can use OrderedDict



from collections import OrderedDict

s=['a', 'b', 'c', 'd', 'a']

print(list(OrderedDict.fromkeys(s)))





share|improve this answer





















  • 1





    I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:13






  • 2





    This solution uses, even if implicitly, another list. :-)

    – Sidon
    Nov 22 '18 at 17:16





















-1














You can cast the list to a set and the cast that back to a list.



l = [1, 1, 2, 2, 3]

s = set(l)

list_without_duplicates = list(s)





share|improve this answer























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53435620%2fdelete-duplicates-of-a-list-whithout-using-using-a-secondary-list%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    -1














    You can use set



    s=['a', 'b', 'c', 'd', 'a']
    
s=list(set(s))
    
print(s)
    
>>> ['b', 'c', 'd', 'a']


    Well, as for the comments, you can use OrderedDict



    from collections import OrderedDict
    
s=['a', 'b', 'c', 'd', 'a']
    
print(list(OrderedDict.fromkeys(s)))





    share|improve this answer





















    • 1





      I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

      – juanpa.arrivillaga
      Nov 22 '18 at 17:13






    • 2





      This solution uses, even if implicitly, another list. :-)

      – Sidon
      Nov 22 '18 at 17:16


















    -1














    You can use set



    s=['a', 'b', 'c', 'd', 'a']
    
s=list(set(s))
    
print(s)
    
>>> ['b', 'c', 'd', 'a']


    Well, as for the comments, you can use OrderedDict



    from collections import OrderedDict
    
s=['a', 'b', 'c', 'd', 'a']
    
print(list(OrderedDict.fromkeys(s)))





    share|improve this answer





















    • 1





      I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

      – juanpa.arrivillaga
      Nov 22 '18 at 17:13






    • 2





      This solution uses, even if implicitly, another list. :-)

      – Sidon
      Nov 22 '18 at 17:16
















    -1












    -1








    -1







    You can use set



    s=['a', 'b', 'c', 'd', 'a']
    
s=list(set(s))
    
print(s)
    
>>> ['b', 'c', 'd', 'a']


    Well, as for the comments, you can use OrderedDict



    from collections import OrderedDict
    
s=['a', 'b', 'c', 'd', 'a']
    
print(list(OrderedDict.fromkeys(s)))





    share|improve this answer















    You can use set



    s=['a', 'b', 'c', 'd', 'a']
    
s=list(set(s))
    
print(s)
    
>>> ['b', 'c', 'd', 'a']


    Well, as for the comments, you can use OrderedDict



    from collections import OrderedDict
    
s=['a', 'b', 'c', 'd', 'a']
    
print(list(OrderedDict.fromkeys(s)))






    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited Nov 22 '18 at 17:16

























    answered Nov 22 '18 at 17:12









    Sandesh34Sandesh34

    254112




    254112








    • 1





      I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

      – juanpa.arrivillaga
      Nov 22 '18 at 17:13






    • 2





      This solution uses, even if implicitly, another list. :-)

      – Sidon
      Nov 22 '18 at 17:16
















    • 1





      I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

      – juanpa.arrivillaga
      Nov 22 '18 at 17:13






    • 2





      This solution uses, even if implicitly, another list. :-)

      – Sidon
      Nov 22 '18 at 17:16










    1




    1





    I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:13





    I imagine if you are not allowed to use another list you are not allowed to use a set, but even if you were, this would then become a clear duplicate.

    – juanpa.arrivillaga
    Nov 22 '18 at 17:13




    2




    2





    This solution uses, even if implicitly, another list. :-)

    – Sidon
    Nov 22 '18 at 17:16







    This solution uses, even if implicitly, another list. :-)

    – Sidon
    Nov 22 '18 at 17:16















    -1














    You can cast the list to a set and the cast that back to a list.



    l = [1, 1, 2, 2, 3]
    
s = set(l)
    
list_without_duplicates = list(s)





    share|improve this answer




























      -1














      You can cast the list to a set and the cast that back to a list.



      l = [1, 1, 2, 2, 3]
      
s = set(l)
      
list_without_duplicates = list(s)





      share|improve this answer


























        -1












        -1








        -1







        You can cast the list to a set and the cast that back to a list.



        l = [1, 1, 2, 2, 3]
        
s = set(l)
        
list_without_duplicates = list(s)





        share|improve this answer













        You can cast the list to a set and the cast that back to a list.



        l = [1, 1, 2, 2, 3]
        
s = set(l)
        
list_without_duplicates = list(s)






        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered Nov 22 '18 at 17:24









        Pablo PaglillaPablo Paglilla

        29715




        29715






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53435620%2fdelete-duplicates-of-a-list-whithout-using-using-a-secondary-list%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Create new schema in PostgreSQL using DBeaver

            Image
            0 At the beginning of my current job I had limited access to DB but recently my role is changed to superuser, admin, and owner. My colleague who was the previous DB admin is able to create a schema or change the permissions as there is a permission tab in the properties and he can change permissions by clicking easily. Would you please let me know how I can create schema and change permissions as well? Why his dbeaver looks different from me? He can easily right click on the schema folder on top of all schemas on the left side column and select create new schema while I do not have that, like the following picture I found on the internet. postgresql database-schema dbeaver share | improve this question
            Read more

            Deepest pit of an array with Javascript: test on Codility

            Image
            0 $begingroup$ This is the question from a Codility test, as a task in an interview: DeepestPit - problem description A non-empty zero-indexed array A consisting of N integers is given. A pit in this array is any triplet of integers (P, Q, R) such that: ·         0 ≤ P < Q < R < N; ·         sequence [A[P], A[P+1], ..., A[Q]] is strictly decreasing, i.e. A[P] > A[P+1] > ... > A[Q]; ·         sequence A[Q], A[Q+1], ..., A[R] is strictly increasing, i.e. A[Q] < A[Q+1] < ... < A[R]. The depth of a pit (P, Q, R) is the number min {A[P] − A[Q], A[R] − A[Q]}. For example, consider array A consisting of 10 elements such that: A[0] = 0 A[1] = 1 A[2] = 3 A[3] = -2 A[4] = 0 A[5] = 1 A[6] = 0 A[7] = -3 A[8] = 2 A[9] = 3 Triplet (2, 3, 4) is
            Read more

            Costa Masnaga

            Image
            .mw-parser-output .avviso .mbox-text-div>div,.mw-parser-output .avviso .mbox-text-full-div>div{font-size:90%}.mw-parser-output .avviso .mbox-image div{width:52px}.mw-parser-output .avviso .mbox-text-full-div .hide-when-compact{display:block} Questa voce o sezione sull'argomento Lombardia non cita le fonti necessarie o quelle presenti sono insufficienti . Puoi migliorare questa voce aggiungendo citazioni da fonti attendibili secondo le linee guida sull'uso delle fonti. Segui i suggerimenti del progetto di riferimento. Costa Masnaga comune Localizzazione Stato   Italia Regione Lombardia Provincia Lecco Amministrazione Sindaco Sabina Panzeri (Al centro il cittadino) dall'08/06/2009 Territorio Coordinate 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Coordinate: 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Altitudine 318 m s.l.m
            Read more