Merge pull request codemistic#470 from paras3624/main

121 Leetcode Solution

Author: gantavyamalviya

121 Leetcode/121 leetcode.py

@@ -0,0 +1,10 @@
+class Solution:
+ def maxProfit(self, prices: List[int]) -> int:
+ maxProfit = 0
+ currentMax = 0
+
+ for i in reversed(prices):
+ currentMax = max(currentMax, i)
+ profit = currentMax - i
+ maxProfit = max(profit, maxProfit)
+ return maxProfit 

BFS in C++/BFS.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <list>
+
+using namespace std;
+
+class Graph {
+ int numVertices;
+ list<int>* adjLists;
+ bool* visited;
+
+ public:
+ Graph(int vertices);
+ void addEdge(int src, int dest);
+ void BFS(int startVertex);
+};
+
+Graph::Graph(int vertices) {
+ numVertices = vertices;
+ adjLists = new list<int>[vertices];
+}
+void Graph::addEdge(int src, int dest) {
+ adjLists[src].push_back(dest);
+ adjLists[dest].push_back(src);
+}
+
+void Graph::BFS(int startVertex) {
+ visited = new bool[numVertices];
+ for (int i = 0; i < numVertices; i++)
+ visited[i] = false;
+
+ list<int> queue;
+
+ visited[startVertex] = true;
+ queue.push_back(startVertex);
+
+ list<int>::iterator i;
+
+ while (!queue.empty()) {
+ int currVertex = queue.front();
+ cout << "Visited " << currVertex << " ";
+ queue.pop_front();
+
+ for (i = adjLists[currVertex].begin(); i != adjLists[currVertex].end(); ++i) {
+ int adjVertex = *i;
+ if (!visited[adjVertex]) {
+ visited[adjVertex] = true;
+ queue.push_back(adjVertex);
+ }
+ }
+ }
+}
+
+int main() {
+ Graph g(4);
+ g.addEdge(0, 1);
+ g.addEdge(0, 2);
+ g.addEdge(1, 2);
+ g.addEdge(2, 0);
+ g.addEdge(2, 3);
+ g.addEdge(3, 3);
+ g.BFS(2);
+ return 0;
+}