About Computer

형광펜

See the Pen Untitled by SungEun Jung (@babyAngel1004) on CodePen.

네온 사인

See the Pen Untitled by SungEun Jung (@babyAngel1004) on CodePen.

입체 테두리

See the Pen Untitled by SungEun Jung (@babyAngel1004) on CodePen.

시네마틱

See the Pen Untitled by SungEun Jung (@babyAngel1004) on CodePen.

출처: https://photoshopvip.net/120163

텍스트 애니메이션

See the Pen Text animation by Yoann (@yoannhel) on CodePen.

1. 알약 설치

https://www.altools.co.kr/Download/ALYac.aspx

2. PC최적화 선택

3. 레지스트리 체크 후 검색시작

+ 검색완료 후 바로 정리 시작하기 체크

문제 

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.

The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2.

Return the quotient after dividing dividend by divisor.

Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−2^31, 2^31 − 1]. For this problem, if the quotient is strictly greater than 2^31 - 1, then return 2^31 - 1, and if the quotient is strictly less than -2^31, then return -2^31.

입출력

Example 1:

Input: dividend = 10, divisor = 3
Output: 3
Explanation: 10/3 = 3.33333.. which is truncated to 3.

Example 2:

Input: dividend = 7, divisor = -3
Output: -2
Explanation: 7/-3 = -2.33333.. which is truncated to -2.

Example 3:

Input: dividend = 0, divisor = 1
Output: 0

Example 4:

Input: dividend = 1, divisor = 1
Output: 1

제약

Constraints:

• -2^31 <= dividend, divisor <= 2^31 - 1
• divisor != 0

코드

var divide = function(dividend, divisor) {
    var isPositive = divisor>0&&dividend>0 || divisor<0&&dividend<0 ? true : false;
    var answer = 0;
    const MAX = 2147483647;
    const MIN  = -2147483648;
    
    divisor = Math.abs(divisor);
    dividend = Math.abs(dividend);
    if(divisor==1) answer = dividend;
    
    while(divisor!=1 && dividend>=divisor) {
        dividend -= divisor;
        answer++;
    }
    
    answer = isPositive? answer : -answer;
    if(answer>MAX) return MAX
    if(answer<MIN) return MIN
    
    return answer; 
};