Plus one Easy Python solution

 class Solution:

    def plusOne(self, digits: List[int]) -> List[int]:

        s=''

        for i in digits:

            s+=str(i)

        s=int(s)+1

        digits.clear()

        digits=[int(i) for i in str(s)]

        return digits

Comments

Post a Comment

If you have any doubt you ask me in comment section

Popular posts from this blog

Create account in java |deposit money|withdraw money

Image
 class bank{ int ac_no; String name, type; float amount; void details (int n, String nm, String t, float a)  { ac_no=n; name=nm; type=t; amount=a; } void show()  { System. out. println(ac_no+" "+name+" "+type+" "+amount) ; } void deposit (float a)  {amount =amount+a; System.out.println(" Deposit amount:"+a) ; } void withdraw (float a)  { if(amount<a)  System.out.println("Balance is insufficient "); else{ amount=amount-a; System.out.println("Withdraw amount:"+a) ; } } void checkbalance()  { System.out.println("Balance is:"+amount); } } class test{ public static void main(String args[])  { bank b=new bank() ; b. details (123456, "Ankit", " Saving ", 1000) ; b. show() ; b. deposit (40000) ; b. checkbalance () ; b. withdraw (10000) ;  b. checkbalance () ; } } Output- 123456 Ankit Saving 1000.0 Deposit amount: 40000.0  Balance is :41000.0 Withdraw amount: 10000 Balance is: 31000
Read more

Library Management System in python OOPs Concept

Image
 class Library:     def__init__(self,listofbooks,libraryname):         self.lst = listofbooks         self.name = libraryname     def displaybook(self):         return f"\t\t\t\tWelcome to {self.name} \         \navaliable books are -\n {self.lst}"     def lendbook(self,lendname,bookname):         if bookname in lst and bookname not in d:             print(f"{bookname} lend to {lendname}")             d.__setitem__(bookname,lendname)         elif bookname in d:             lst.remove(bookname)             print("Book is not available lend to-",d[bookname],"\nwe only have-",lst)         else:             print("Book is not in the library we only have-",lst)   ...
Read more

Digit frequency solution in c hackerrank solution

Given a string,  , consisting of alphabets and digits, find the frequency of each digit in the given string. Input Format The first line contains a string,   which is the given number. Constraints Given a string, , consisting of alphabets and digits, find the frequency of each digit in the given string. Input Format The first line contains a string, which is the given number. Constraints All the elements of num are made of english alphabets and digits. . Output Format Print ten space-separated integers in a single line denoting the frequency of each digit from   to  . Sample Input 0 a11472o5t6 Sample Output 0 0 2 1 0 1 1 1 1 0 0 Explanation 0 In the given string:  occurs two times.  and   occur one time each. The remaining digits   and   don't occur at all. Sample Input 1 lw4n88j12n1 Sample Output 1 0 2 1 0 1 0 0 0 2 0 Sample Input 2 1v88886l256338ar0ekk Sample Output 2 1 1 1 2 0 1 2 0 5 0 #include<stdio.h>...
Read more