Page này để học tiếng anh

  • Home
  • Page này để học tiếng anh

Page này để học tiếng anh this page to enjoy English

17/09/2021

Hướng dẫn xem bản đồ quy hoạch.

https://remaps.vn/
17/09/2021

https://remaps.vn/

Với cơ sở dữ liệu phong phú và được thu thập, xử lý độc lập trên dữ liệu gốc của các nguồn đáng tin cậy. Remaps mang đến một Bất động sản có vị trí thật, tồn tại thật, và thật dễ để kiểm tra.

https://readme.so/fr/editor
15/06/2021

https://readme.so/fr/editor

Use readme.so's markdown editor and ready made templates to easily create a simple README for your repositories

04/06/2021
02/05/2021

const toId = {
ref: (symbol) => ` #${symbol}ref`,
ceil: (symbol) => ` #${symbol}ceil`,
floor: (symbol) => ` #${symbol}floor`,
tval: (symbol) => ` #${symbol}tval`,
tvol: (symbol) => ` #${symbol}tvol`,
highP:(symbol) => ` #${symbol}highP`,
avgP:(symbol) => ` #${symbol}avgP`,
lowP:(symbol) => ` #${symbol}lowP`,
bV4: (symbol) => ` #${symbol}bV4`,
sV4: (symbol) => ` #${symbol}sV4`,
room: (symbol) => ` #${symbol}room`,
foreignB: (symbol) => ` #${symbol}foreignB`,
foreignS: (symbol) => ` #${symbol}foreignS`,
price : {
sell: {
oP1: (symbol) => ` #${symbol}oP1`,
oV1: (symbol) => ` #${symbol}oV1`,
oP2: (symbol) => ` #${symbol}oP2`,
oV2: (symbol) => ` #${symbol}oV2`,
oP3: (symbol) => ` #${symbol}oP3`,
oV3: (symbol) => ` #${symbol}oV3`,
},
buy : {
bP3: (symbol) => ` #${symbol}bP3`,
bV3: (symbol) => ` #${symbol}bV3`,
bP2: (symbol) => ` #${symbol}bP2`,
bV2: (symbol) => ` #${symbol}bV2`,
bP1: (symbol) => ` #${symbol}bP1`,
bV1: (symbol) => ` #${symbol}bV1`,
}
}
}
const toObject = (stockCode) => {
return {
symbol : stockCode ,
ref: textById(toId.ref(stockCode)),
ceil: textById(toId.ceil(stockCode)),
floor: textById(toId.floor(stockCode)),
tval: textById(toId.tval(stockCode)),
tvol: textById(toId.tvol(stockCode)),
highP: textById(toId.highP(stockCode)),
avgP: textById(toId.avgP(stockCode)),
lowP: textById(toId.lowP(stockCode)),
bV4: textById(toId.bV4(stockCode)),
sV4: textById(toId.sV4(stockCode)),
room: textById(toId.room(stockCode)),
foreignB: textById(toId.foreignB(stockCode)),
foreignS: textById(toId.foreignS(stockCode)),
price:
{
sell : {
oP1: textById(toId.price.sell.oP1(stockCode)),
oV1: textById(toId.price.sell.oV1(stockCode)),
oP2: textById(toId.price.sell.oP2(stockCode)),
oV2: textById(toId.price.sell.oV2(stockCode)),
oP3: textById(toId.price.sell.oP3(stockCode)),
oV3: textById(toId.price.sell.oV3(stockCode)),
},
buy : {
bP3: textById(toId.price.buy.bP3(stockCode)),
bV3: textById(toId.price.buy.bV3(stockCode)),
bP2: textById(toId.price.buy.bP2(stockCode)),
bV2: textById(toId.price.buy.bV2(stockCode)),
bP1: textById(toId.price.buy.bP1(stockCode)),
bV1: textById(toId.price.buy.bV1(stockCode)),
}
}
}
}
const textById = (id) => document.querySelector(id).innerText;
let arrObject = [...document.querySelectorAll(" -khop-lenh-body tr")].map( stoctRow => stoctRow.getAttribute("id"))
.map(toObject);
const decodeConstructor = (arr) => {
const schema = {
symbol : 0,
ref: 1,
ceil: 2,
floor: 3,
tval: 4,
tvol: 5,
highP: 6,
avgP: 7,
lowP: 8,
bV4: 9,
sV4: 10,
room: 11,
foreignB: 12,
foreignS: 13,
price:
{
sell : {
oP1: 14,
oV1: 15,
oP2: 16,
oV2: 17,
oP3: 18,
oV3: 19,
},
buy : {
bP3: 20,
bV3: 21,
bP2: 22,
bV2: 23,
bP1: 24,
bV1: 25,
}
}
};
const toObject = (item) => {
return {
symbol : item[schema.symbol] ,
ref: item[schema.ref] ,
ceil: item[schema.ceil] ,
floor: item[schema.floor] ,
tval: item[schema.tval] ,
tvol: item[schema.tvol] ,
highP: item[schema.highP] ,
avgP: item[schema.avgP] ,
lowP: item[schema.lowP] ,
bV4: item[schema.bV4] ,
sV4: item[schema.sV4] ,
room: item[schema.room] ,
foreignB: item[schema.foreignB] ,
foreignS: item[schema.foreignS] ,
price:
{
sell : {
oP1: item[schema.price.sell.oP1] ,
oV1: item[schema.price.sell.oV1] ,
oP2: item[schema.price.sell.oP2] ,
oV2: item[schema.price.sell.oV2] ,
oP3: item[schema.price.sell.oP3] ,
oV3: item[schema.price.sell.oV3] ,
},
buy : {
bP3: item[schema.price.buy.bP3] ,
bV3: item[schema.price.buy.bV3] ,
bP2: item[schema.price.buy.bP2] ,
bV2: item[schema.price.buy.bV2] ,
bP1: item[schema.price.buy.bP1] ,
bV1: item[schema.price.buy.bV1] ,
}
}
}
}
return arr.map(toObject)
}
const encodeConstructot = (arrObject) => {
const flaten = (o) => {
return Object.keys(o).reduce(function(out, key) {
out = out.concat(
(typeof o[key] === 'object' && o[key] !== null ) ? flaten(o[key]) : [o[key]]
);
return out;
}, []);
}
return arrObject.map(flaten);
}
// const watchList = ["VRE","POW"];
// arrObject = arrObject.filter( b => watchList.indexOf(b.symbol) !== -1 );
const arr = encodeConstructot(arrObject);
const output = decodeConstructor(arr);
console.log(JSON.stringify(arrObject));
console.log(JSON.stringify(output));

class Grap { V; adj = []; constructor(V) { this.V = V; for( let i = 0 ; i < V ; i++) this.adj.push([]);...
19/04/2021

class Grap {
V; adj = [];
constructor(V) {
this.V = V;
for( let i = 0 ; i < V ; i++)
this.adj.push([]);
}
isCyclicUtil(i, visited, recStack, path) {
if(this.adj[i].length !== 0) {
path.push(i);
}
if(recStack[i]) return true ;
if(visited[i]) return false;
visited[i] = true ;
recStack[i] = true;
for( let j = 0 ; j < this.adj[i].length ; j++ ) {
if(this.isCyclicUtil(this.adj[i][j], visited , recStack, path)) {
return true ;
}
}
recStack[i] = false;
return false;
}
isCyclic() {
var visited = [];
var recStack = [];
for( let i = 0 ; i < this.V ; i++) {
visited[i] = false ; recStack[i] = false ;
}
var path = [];
for( let i = 0 ; i< this.V ; i++) {
if(this.isCyclicUtil(i,visited,recStack , path )) {
console.log(path);
return (path[0] === path[path.length -1 ] && [...new Set(path)].length === [...new Set(this.adj.filter(z => z.length !== 0))].length);
}
}
return false;
}
addEdge( source, dest) {
this.adj[source].push(dest);
}
}
function solution(a, b) {
var edge = ([...a, ...b].sort( (a,b) => b - a)[0] || 0) + 1;
var graph = new Grap(edge);
a.forEach((p , index) => graph.addEdge(a[index], b[index])) ;
if(graph.isCyclic()) {
console.log("Graph contains cycle");
return true;
} else {
console.log("Graph doesn't "
+ "contain cycle");
return false;
}
}
const a = [1,3,2,4];
const b = [4,1,3,2];
solution(a,b);
const a1 = [1,2,3,4];
const b1 = [2,1,4,3];
solution(a1,b1);

var a = ["pim","pom"];var b = ["99999999","778899"];var p = "88999";function solution(a,b,p) { return (a.map((z, id) =>...
18/04/2021

var a = ["pim","pom"];
var b = ["99999999","778899"];
var p = "88999";

function solution(a,b,p) {
return (a.map((z, id) => { return { name : z , phone: b[id] }}).sort( (a, b) => b.name.localeCompare(a.name))[0] || {name: "NO CONTACT"}).name;
}

solution(a,b,p)

String.prototype.replaceAt = function(index, replacement) { return this.substr(0, index) + replacement + this.substr(...
18/04/2021

String.prototype.replaceAt = function(index, replacement) {
return this.substr(0, index) + replacement + this.substr(index + replacement.length);
}
function solution(s) {
return [].concat(...s.split("").map( (z , index) => "0123456789".split("").map( k => s.replaceAt(index,k)) )).filter( z => Number(z)%3 ===0).length;
}

solution("23")

function solution(a) { return [...new Set(a)].map( z => a.reduce((pre, cur) => pre += Math.abs(cur - z ) , 0)).sort()[0]...
18/04/2021

function solution(a) {
return [...new Set(a)].map( z => a.reduce((pre, cur) => pre += Math.abs(cur - z ) , 0)).sort()[0];
}
solution([3,2,1,1,2,3,1])

https://quillbot.com/
01/04/2021

https://quillbot.com/

QuillBot's paraphrasing tool is trusted by millions worldwide to rewrite sentences, paragraphs, or articles using state-of-the-art AI.

https://obfuscator.io/
13/03/2021

https://obfuscator.io/

JavaScript Obfuscator is a free online tool that obfuscates your source code, preventing it from being stolen and used without permission.

input var b = [1, "2" , 5 , "g" , 0 , "f"]; output [0, "2", 1, "g", 5, "f"], just sort the numbers
28/02/2021

input var b = [1, "2" , 5 , "g" , 0 , "f"]; output [0, "2", 1, "g", 5, "f"],
just sort the numbers

28/02/2021
25/10/2020

Address


Website

Alerts

Be the first to know and let us send you an email when Page này để học tiếng anh posts news and promotions. Your email address will not be used for any other purpose, and you can unsubscribe at any time.

Shortcuts

  • Address
  • Alerts
  • Claim ownership or report listing

  • Want your business to be the top-listed Event Planning Service?

Share