Skip to content

Instantly share code, notes, and snippets.

View kntmr's full-sized avatar

kntmr kntmr

9 followers · 49 following
  • Japan
View GitHub Profile
@kntmr
kntmr / vue-spring-boot-examples.md
Last active August 23, 2017 06:15
vue + axios + spring-boot

備忘録

package.json

npm init

ライブラリインストール

@kntmr
kntmr / api.js
Created February 28, 2018 10:33
API module
import axios from 'axios'
const debug = process.env.NODE_ENV !== 'production'
const onSuccess = (resp) => {
if (debug) {
console.log(' << ' + JSON.stringify(resp.data))
}
return Promise.resolve(resp.data)
}
@kntmr
kntmr / vue-draggable-examples.html
Last active December 26, 2018 03:40
Vue Draggable Example
<!DOCTYPE html>
<html lang="ja">
<head>
<meta charset="UTF-8">
<title>Vue Draggable Example</title>
<script src="//cdnjs.cloudflare.com/ajax/libs/vue/2.5.2/vue.min.js"></script>
<script src="//cdn.jsdelivr.net/npm/sortablejs@1.7.0/Sortable.min.js"></script>
<script src="//cdnjs.cloudflare.com/ajax/libs/Vue.Draggable/2.17.0/vuedraggable.min.js"></script>
<style>
body {
@kntmr
kntmr / vue-component-examples.html
Last active January 11, 2019 08:33
Vue Component Example
<!DOCTYPE html>
<html lang="ja">
<head>
<meta charset="UTF-8">
<title>Vue Component Example</title>
<script src="https://unpkg.com/vue/dist/vue.js"></script>
<style>
body {
text-align: center;
}
@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];
@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 / 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 / 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 / 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 / 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;