TechDev

/**
 * @param {string} haystack
 * @param {string} needle
 * @return {number}
 */
let strStr = function(haystack, needle) {
  return haystack.indexOf(needle)
};

https://leetcode.com/problems/implement-strstr

정렬 + 투 포인터문제

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int arr[100001];

int main()
{
    int n, target, s = 0, e;
    cin >> n;
    e = n - 1;

    for (int i = 0; i < n; i++)
        cin >> arr[i];
    cin >> target;

    sort(arr, arr + n);

    int cnt = 0;

    while (s < e) {
        int value = arr[s] + arr[e];
        if (value == target) {
            cnt++;
            e--;
            s++;
        }
        else if (value > target)  e--;
        else s++;
    }
    cout << cnt;
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int arr[500001];

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> arr[i];

    sort(arr, arr + n);

    for (int i = 0; i < n; i++)
        printf("%d ", arr[i]);
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int arr[1000001];

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);

    sort(arr, arr + n, greater<int>());

    for (int i = 0; i < n; i++)
        printf("%d\n", arr[i]);
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int main()
{
    int n;
    long long temp;
    map<long long, int> msi;
    pair<long long, int> ans = { 0, 0 };

    cin >> n;
    for (int i = 0; i < n; i++) {
        scanf("%lld", &temp);

        if (msi.find(temp) == msi.end()) // 입력값이 map에 없을 경우
            msi[temp] = 0;
        msi[temp]++; //
        
        if (ans.second == msi[temp]) {
            if (ans.first > temp){
                ans = { temp, msi[temp] };
            }
        }
        else if (ans.second < msi[temp])
            ans = { temp, msi[temp] };
    }

    cout << ans.first << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, m;
int n_idx = 0, m_idx = 0;

int main()
{
    cin >> n >> m;
    vector<int> vin(n), vim(m);
    vector<int> ans;

    for (int i = 0; i < n; i++)
        scanf("%d", &vin[i]);
    for (int i = 0; i < m; i++)
        scanf("%d", &vim[i]);

    for (;;) {
    	// vin이나 vim이 끝에 도달했으면 남은 값들 푸쉬
        if (n_idx == n)
            for (; m_idx < m; m_idx++)
                ans.push_back(vim[m_idx]);
        else if (m_idx == m)
            for (; n_idx < n; n_idx++)
                ans.push_back(vin[n_idx]);
		
        //탈출 조건
        if (n_idx == n || m_idx == m) break;

        if (vin[n_idx] > vim[m_idx]) {
            ans.push_back(vim[m_idx]);
            m_idx++;
        }
        else if (vin[n_idx] < vim[m_idx]) {
            ans.push_back(vin[n_idx]);
            n_idx++;
        }
        else {
            ans.push_back(vim[m_idx]);
            ans.push_back(vin[n_idx]);
            m_idx++;
            n_idx++;
        }
    }

    for (int i = 0, size = ans.size(); i < size; i++)
        printf("%d ", ans[i]);
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    string str;
    int ans = 0;
    cin >> str;
    for (int i = 0, len = str.length(); i < len; i++)
        ans += (str[i] - '0');

    cout << (ans % 7 == 4 ? "suspect" : "citizen");
    return 0;
}

아슬아슬하게 통과한 코드

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int m;
    cin >> m;
    vector<int> vim(m);
    for (int i = 0; i < m; i++)
        scanf("%d", &vim[i]);

    sort(vim.begin(), vim.end());

    int n;
    int temp;
    cin >> n;
    vector<int> vin(n);

    for (int i = 0; i < n; i++) {
        scanf("%d", &temp);
        printf("%d ", binary_search(vim.begin(), vim.end(), temp));
    }
    return 0;
}