Merge branch 'main' of https://github.com/tkzzzzzz6/Algorithm_beginner_learning_notes

Author: tkzzzzzz6

niuke/practice/noob/noob93 【模板】队列操作/1.cpp

@@ -1,51 +1,61 @@
 #include <iostream>
 #include <queue>
-#include <vector>
 using namespace std;
 
-template <typename T>
-class Queue_e{
+template <typename T> class Queue_e {
+
+  queue<T> q;
 
-    queue<T> q;
 public:
+  void push(const T &x) { q.push(x); }
 
-    void push(const T& x){
-        q.push(x);
+  void pop() {
+    if (!q.empty()) {
+      q.pop();
+    } else {
+      cout << "ERR_CANNOT_POP\n";
     }
+  }
 
-    void pop(){
-        if(!q.empty()){
-            q.pop();
-        }else{
-          cout << "ERR_CANNOT_POP\n";
-        }
+  void front() const {
+    if (!q.empty()) {
+      cout << q.front() << '\n';
+    } else {
+      cout << "ERR_CANNOT_QUERY\n";
     }
+  }
 
-    void front() const {
-        if(!q.empty()){
-            cout << q.fornt() << '\n';
-        }else{
-          cout << "ERR_CANNOT_QUERY\n";
-        }
-    }
-
-    void size() const {
-        cout << q.size() << '\n';
-    }
-
-    bool empty() const {
-        return q.empty();
-    }
+  void size() const { cout << q.size() << '\n'; }
 
+  bool empty() const { return q.empty(); }
 };
 
 int main() {
-    Queue_e<int> qe;
-    int n;cin>> n;
-
-    while(n--){
-        
+  Queue_e<int> qe;
+  int n;
+  cin >> n;
+
+  while (n--) {
+    int op;
+    cin >> op;
+    switch (op) {
+    case 1: {
+      int x;
+      cin >> x;
+      qe.push(x);
+      break;
     }
-
+    case 2:
+      qe.pop();
+      break;
+    case 3:
+      qe.front();
+      break;
+    case 4:
+      qe.size();
+      break;
+    }
+  }
+  return 0;
 }
 // 64 位输出请用 printf("%lld")

niuke/practice/noob/noob94 无法吃午餐的学生数量/1.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+    /**
+     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
+     *
+     * 
+     * @param students int整型vector 
+     * @param sandwiches int整型vector 
+     * @return int整型
+     */
+    int countStudents(vector<int>& students, vector<int>& sandwiches) {
+        // write code here
+        int i = 0,j = 0,ans = 0;
+        while(i < students.size() && j < students.size()){
+            if(students[i] == sandwiches[j]){
+                ++i;++j;
+            }else{
+                ++i;
+                ++ans;
+            }
+        }
+        return ans;
+    }
+};