Merge pull request #269 from Kavisha20340/master

Added solution to Leetcode problem 1290

Author: larissalages

leetcode/cpp/Stacks/682.cpp

@@ -0,0 +1,33 @@
+//Problem 682 : Baseball Game(using stack)
+
+class Solution {
+public:
+	int calPoints(vector<string>& ops) 
+	{
+		int result = 0; 
+		stack <int> score;
+		for (auto x : ops)
+		{
+			if (x == "C" && !score.empty()) 
+				score.pop();
+			else if(x == "D" && !score.empty())
+				score.push(2*score.top());
+			else if(x == "+" && !score.empty())
+			{
+				int top1 = score.top();
+				score.pop();
+				int top2 = score.top();
+				score.push(top1);
+				score.push((top1+top2));
+			}
+			else 
+				score.push(stoi(x)); // convert from string to int then push on stack
+		}
+		while(!score.empty())
+		{
+			result += score.top();
+			score.pop();
+		}
+		return result;
+	}
+};

leetcode/cpp/linkedlist/1290.cpp

@@ -0,0 +1,28 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    int getDecimalValue(ListNode* head) {
+    	int answer = 0;
+    	vector<int> v;
+    	while(head){
+    		v.push_back(head->val);
+    		head = head->next;
+    	}
+    	reverse(v.begin(),v.end());
+    	for (int i = 0; i < v.size(); i++)
+    		if(v.at(i))
+    			answer += pow(2,i);
+        return answer;
+    }
+};
+
+