HR - Drawing Book
5884 ワード
質問する
A teacher asks the class to open their books to a page number. A student can either start turning pages from the front of the book or from the back of the book. They always turn pages one at a time. When they open the book, page
1
is always on the right side:When they flip page
1
, they see pages 2
and 3
. Each page except the last page will always be printed on both sides. The last page may only be printed on the front, given the length of the book. If the book is n
pages long, and a student wants to turn to page p
, what is the minimum number of pages to turn? They can start at the beginning or the end of the book.Given
n
and p
, find and print the minimum number of pages that must be turned in order to arrive at page p
例
6
2
// 1
5
4
// 0
に答える
page
ページと2
ページを増やしたり減らしたりします.ページをめくる回数を毎回記録します.コード#コード#
function pageCount(n, p) {
let page = 1;
let pageTurn = 0;
if(n/2 < p){
page = n; // right 에서부터 넘기기
if(page % 2 !== 0 && page-1 === p) return 0;
}
if(page === 1) {
while(page < p) {
page += 2;
pageTurn++;
}
} else{
if(page % 2 === 0) {
while(page >= p+1) {
page -= 2;
pageTurn++;
}
}
else {
while(page > p+1) {
page -= 2;
pageTurn++;
}
}
}
return pageTurn;
}
Reference
この問題について(HR - Drawing Book), 我々は、より多くの情報をここで見つけました https://velog.io/@goody/HR-Drawing-Bookテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol