Skip to content

Instantly share code, notes, and snippets.

View kntmr's full-sized avatar

kntmr kntmr

10 followers · 49 following
  • Japan
View GitHub Profile
@kntmr
kntmr / cancel_key_event_sample.html
Last active March 12, 2021 07:38
<!DOCTYPE html>
<html lang="ja">
<head>
<meta charset="UTF-8">
<title>Document</title>
<style>
.lock {
overflow: hidden;
}
.overlay {
@kntmr
kntmr / translate_from_s3.py
Created June 7, 2020 07:59
import json
import urllib.parse
import boto3
import datetime
print('Loading function')
s3 = boto3.client('s3')
def read_input_text(bucket_name, input_key):
@kntmr
kntmr / MyReceiveQueueEmail.php
Last active April 21, 2020 13:44
<?php
require '../vendor/autoload.php';
use Aws\Sqs\SqsClient;
use Aws\Exception\AwsException;
use Aws\Ses\SesClient;
$queueUrl = '<QUEUE_URL>';
$client = new SqsClient([
@kntmr
kntmr / MySendQueueEmail.php
Last active April 21, 2020 08:08
<?php
require '../vendor/autoload.php';
use Aws\Sqs\SqsClient;
use Aws\Exception\AwsException;
date_default_timezone_set('Asia/Tokyo');
$client = new SqsClient([
'region' => 'ap-northeast-1',
@kntmr
kntmr / PrimeNumber.java
Created September 4, 2019 03:57
Prime number
package com.example.demo;
public class PrimeNumber {
boolean primeNumber(int n) {
if (n < 2) return false;
int sqrt = (int) Math.sqrt(n);
for (int i = 2; i <= sqrt; i++) {
if (n % i == 0) {
return false;
@kntmr
kntmr / Fib.java
Created September 4, 2019 03:57
Fibonacci sequence
package com.example.demo;
public class Fib {
int fib(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
return fib(n - 2) + fib(n - 1);
}
@kntmr
kntmr / BinarySearch.java
Created September 4, 2019 03:56
Binary search algorithm
package com.example.demo;
public class BinarySearch {
int binarySearch(int[] a, int n, int left, int right) {
if (left > right) return -1;
int mid = (left + right) / 2;
if (n < a[mid]) {
return binarySearch(a, n, 0, mid - 1);
}
@kntmr
kntmr / MergeSort.java
Created September 4, 2019 03:56
Merge sort algorithm
package com.example.demo;
public class MergeSort {
void mergeSort(int[] a, int[] temp, int left, int right) {
if (left >= right) return;
int mid = (left + right) / 2;
mergeSort(a, temp, left, mid);
mergeSort(a, temp, mid + 1, right);
merge(a, temp, left, right, mid);
@kntmr
kntmr / QuickSort.java
Last active April 6, 2020 09:36
Quick sort algorithm
package com.example.demo;
public class QuickSort {
void quickSort(int[] a, int left, int right) {
int index = replace(a, left, right);
if (left < index - 1) {
quickSort(a, left, index - 1);
}
if (index < right) {
@kntmr
kntmr / BubbleSort.java
Created September 4, 2019 03:54
Bubble sort algorithm
package com.example.demo;
public class BubbleSort {
void bubbleSort(int[] a) {
for (int i = 0; i < a.length; i++) {
for (int j = i + 1; j < a.length; j++) {
if (a[i] > a[j]) {
int temp = a[i];
a[i] = a[j];