<p>Given a string <code>date</code> representing a <a href="https://en.wikipedia.org/wiki/Gregorian_calendar" target="_blank">Gregorian calendar</a> date formatted as <code>YYYY-MM-DD</code>, return <em>the day number of the year</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> date = &quot;2019-01-09&quot;
<strong>Output:</strong> 9
<strong>Explanation:</strong> Given date is the 9th day of the year in 2019.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> date = &quot;2019-02-10&quot;
<strong>Output:</strong> 41
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>date.length == 10</code></li>
	<li><code>date[4] == date[7] == &#39;-&#39;</code>, and all other <code>date[i]</code>&#39;s are digits</li>
	<li><code>date</code> represents a calendar date between Jan 1<sup>st</sup>, 1900 and Dec 31<sup>th</sup>, 2019.</li>
</ul>

class Solution {
public:
    int dayOfYear(string date) {
        int m1[] = {0,31,29,31,30,31,30,31,31,30,31,30};
        int m2[] = {0,31,28,31,30,31,30,31,31,30,31,30};
        vector<int> d;
        string st="";
        for(int i=0;i<date.length();i++){
            if(date[i]=='-'){d.push_back(stoi(st));st="";}
            else{st+=date[i];}
        }
        d.push_back(stoi(st));
        int year = d[0];
        int month = d[1];
        int day = d[2];
        if (year%4==0 && year!=1900){
            int s = day;
            for(int i=0;i<month;i++){s+=m1[i];}
            return s;
        }
        else{
            int s = day;
            for(int i=0;i<month;i++){s+=m2[i];}
            return s;
        }
    }
};
13500