idfumg

package main

import "fmt"

type Set[T comparable] struct {
	items map[T]struct{}
}

func NewSet[T comparable]() *Set[T] {
	return &Set[T]{

idfumg

#include <iostream>
#include <stdexcept>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <optional>
#include <cassert>

using namespace std;

idfumg

version: '3'

services:

  postgres:
    image: 'postgres:14.5'
    container_name: "postgres_isolation"
    restart: always
    environment:
      - POSTGRES_DB=isolation_levels

idfumg

[Connection]

brew install pgcli
pgcli -h localhost -p 5432 -U postgres isolation_levels # password postgres

[Preparation]

DROP TABLE IF EXISTS accounts;
CREATE TABLE accounts (
    id SERIAL PRIMARY KEY,

idfumg

const (
    INF = int(1e9)
)

func maxProfit(prices []int) int {
    cache := createCache(len(prices), -1)
    return run(0, 0, prices, cache)
}

func createCache[T any](N int, val T) [][]T {

idfumg

const (
    INF = int(1e9)
)

var (
    cache [100001][2]int
)

func maxProfit(nums []int) int {
    initCache(len(nums), -1)

idfumg

const (
    INF = int(1e9)
)

var (
    cache [100001][2]int
    nums [100001]int
    N int
)

idfumg

static int INF = 1e9+7;
static int N = 0;
static vector<int> nums;
static int cache[100001][2];

static void init(vector<int>& prices) {
    N = size(prices);
    nums.resize(N);
    for (int i = 0; i < N; ++i) {
        nums[i] = prices[i];

idfumg

static int INF = 1e9+7;
static int cache[100001][2];

static int run(int idx, int taken, vector<int>& nums) {
    const int N = size(nums);
    if (idx == N and taken == 1) return -INF;
    if (idx == N) return 0;
    if (cache[idx][taken] != -1) return cache[idx][taken];
    if (taken) return cache[idx][taken] = max(
        run(idx + 1, 1, nums),

idfumg

class Solution:
    def maxProfit(self, nums: List[int]) -> int:
        return sol8(nums)

def sol1(nums):
    N = len(nums)
    INF = 10**10

    @cache
    def run(idx, taken):