415. Add Strings - LeetCode Solution


String

Python Code:

class Solution:
    def addStrings(self, num1: str, num2: str) -> str:
        ptr1 = len(num1) - 1
        ptr2 = len(num2) -1

        carry = 0
        res = ""

        while ptr1 >=0 or ptr2 >= 0:

            if ptr1 < 0:
                a = str( int(num2[ptr2]) + carry)
            elif ptr2 <0:
                a = str(int(num1[ptr1]) + carry)
            else:
                a = str(int(num1[ptr1]) + int(num2[ptr2]) + carry)


            if len(a) == 2:
                carry = int(a[0])
                res += a[1]
            else:
                carry= 0
                res+=a

            if ptr2 >=0:
                ptr2-=1
            if ptr1>=0:
                ptr1-=1
        
        
        if carry!= 0:
            res+= str(carry)

        return res[::-1]


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST