This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<div class="container"> | |
<ul id="bandList"></ul> | |
</div> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"Layout": { | |
"defaultSubCategory": "Basic", | |
"subcategories": { | |
"Basic": { | |
"Columns": { | |
"variants": { | |
"default": { | |
"1 ~ 6": { | |
"columns-1": { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<template> | |
<div>Data: {{ data }}</div> | |
<button @mousedown="method"></button> | |
</template> | |
<script lang="ts" setup> | |
import { computed, ref } from 'vue' | |
const test = ref(100) | |
const data = computed(() => test.value + 200) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php | |
/** | |
* Bitmap Holes | |
* Have the function BitmapHoles(strArr) take the array of strings stored in strArr, | |
* which will be a 2D matrix of 0 and 1's, and determine how many holes, or contiguous regions of 0's, | |
* exist in the matrix. A contiguous region is one where there is a connected group of 0's going | |
* in one or more of four directions: up, down, left, or right. | |
* | |
* For example: if strArr is ["10111", "10101", "11101", "11111"], then this looks like the following matrix: | |
* |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php | |
/** | |
* Longest Increasing Sequence | |
* Have the function LongestIncreasingSequence(arr) take the array of positive integers stored in arr | |
* and return the length of the longest increasing subsequence (LIS). A LIS is a subset of the original list | |
* where the numbers are in sorted order, from lowest to highest, and are in increasing order. | |
* The sequence does not need to be contiguous or unique, and there can be several different subsequences. | |
* For example: if arr is [4, 3, 5, 1, 6] then a possible LIS is [3, 5, 6], and another is [1, 6]. | |
* For this input, your program should return 3 because that is the length of the longest increasing subsequence. | |
* |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<template> | |
<keep-alive> | |
<transition-group tag="div" name="tool" appear> | |
<div class="wk-tool-inner" v-for="number in [active]" v-bind:key="number"> | |
<component :is="componentInstance"/> | |
</div> | |
</transition-group> | |
</keep-alive> | |
</template> | |
<script> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var CACHE_VERSION = 'WebsKit-CACHE-E05' | |
var CACHE_FILES = [ | |
'./' | |
] | |
self.addEventListener('install', function (event) { | |
event.waitUntil( | |
caches.open(CACHE_VERSION) | |
.then(function (cache) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<biblioteca> | |
<libro> | |
<nombre>Mastering Gradle</nombre> | |
<autor>Mainak Mitra</autor> | |
</libro> | |
<libro> | |
<nombre>Mastering GitHub</nombre> | |
<autor>Mainak Mitra</autor> | |
</libro> | |
<libro> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class CoinChange { | |
constructor(changes) { | |
this.coins = 0; | |
this.changes = changes; | |
this.output = {}; | |
}; | |
getEquivalence(equivalence) { | |
let output = 0; | |
if(this.coins / equivalence > 1){ | |
output = (this.coins - (this.coins % equivalence)) / equivalence; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class CoinChange { | |
constructor(changes) { | |
this.coins = 0; | |
this.changes = changes; | |
this.output = {}; | |
}; | |
getEquivalence(equivalence) { | |
let output = 0; | |
if(this.coins / equivalence > 1){ | |
output = (this.coins - (this.coins % equivalence)) / equivalence; |
NewerOlder