Polynomials Addition

-

This is a classic problem, usually solved with either two-pointers (merge-sort style), or a simple recursion. In the case below, I have opted for a recursive solution. Here is the problem: https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists/

The recursion will have one base case followed by four induction steps. Base case is straightforward. The four induction steps are: head of poly1 greater than head of poly2, head of poly2 greater than head of poly1, both being the same but the addition leading to a zero coefficient, or finally both being the same and the sum not leading to a zero coefficient. Works well, code is below, cheers! ACC

public PolyNode AddPoly(PolyNode poly1, PolyNode poly2)
{
    if (poly1 == null) return poly2;
    if (poly2 == null) return poly1;

    if (poly1.power > poly2.power)
        return new PolyNode(poly1.coefficient, poly1.power, AddPoly(poly1.next, poly2));
    else if (poly1.power < poly2.power)
        return new PolyNode(poly2.coefficient, poly2.power, AddPoly(poly1, poly2.next));
    else if (poly1.coefficient + poly2.coefficient == 0)
        return AddPoly(poly1.next, poly2.next);
    else
        return new PolyNode(poly1.coefficient + poly2.coefficient, poly1.power, AddPoly(poly1.next, poly2.next));
}

Comments

Post a Comment

Popular posts from this blog

Count Binary Substrings

-
Image
Problem by Leetcode:  https://leetcode.com/problems/count-binary-substrings/description/ Give a string  s , count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively. Substrings that occur multiple times are counted the number of times they occur. Example 1: Input: "00110011" Output: 6 Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01". Notice that some of these substrings repeat and are counted the number of times they occur. Also, "00110011" is not a valid substring because all the 0's (and 1's) are not grouped together. Example 2: Input: "10101" Output: 4 Explanation: There are 4 substrings: "10", "01", "10", "01&
Read more

Count Vowels Permutation: Standard DP

-
Image
Standard DP problem:  https://leetcode.com/problems/count-vowels-permutation/ Given an integer  n , your task is to count how many strings of length  n  can be formed under the following rules: Each character is a lower case vowel ( 'a' ,  'e' ,  'i' ,  'o' ,  'u' ) Each vowel  'a'  may only be followed by an  'e' . Each vowel  'e'  may only be followed by an  'a'  or an  'i' . Each vowel  'i'   may not  be followed by another  'i' . Each vowel  'o'  may only be followed by an  'i'  or a  'u' . Each vowel  'u'  may only be followed by an  'a'. Since the answer may be too large, return it modulo  10^9 + 7. Example 1: Input: n = 1 Output: 5 Explanation: All possible strings are: "a", "e", "i" , "o" and "u". Example 2: Input: n = 2 Output: 10 Explanation: All possible strings are
Read more

Maximum Number of Balloons

-
Image
#431 in my solved list:  https://leetcode.com/problems/maximum-number-of-balloons/ Given a string  text , you want to use the characters of  text  to form as many instances of the word  "balloon"  as possible. You can use each character in  text   at most once . Return the maximum number of instances that can be formed.   Example 1: Input: text = "nlaebolko" Output: 1 Example 2: Input: text = "loonbalxballpoon" Output: 2 Example 3: Input: text = "leetcode" Output: 0 Constraints: 1 <= text.length <= 10^4 text  consists of lower case English letters only. Solution is as follows:  - Count the number of occurrences of the "balloon" letters in the input string  - For "l" and "o", divide the count by 2  - If the balloon string is not fully covered, return 0  - Return the min number across all occurrences Code is below, cheers, ACC. public class Solution {     public int M
Read more