Grace
grace's dev_note
Grace
전체 방문자
오늘
어제
  • 분류 전체보기
    • FrontEnd
      • Next.js
      • React
      • ReactNativ..
      • Vue
    • Javascript
      • 러닝 자바스크립트
      • 모던 자바스크립트
    • CS
    • DataScienc..
      • Data Struc..
      • LeetCode
    • BackEnd
      • Express
      • Node.js
      • Nest.js
    • DevOps
      • Docker
    • 매일메일
    • 회고
    • 코드캠프

블로그 메뉴

  • 홈
  • 태그
  • 방명록

공지사항

인기 글

태그

  • Vue3
  • node.js
  • tanstack
  • postgres
  • 자바스크립트
  • 함수
  • Vite
  • 알고리즘
  • React Native
  • 번들러
  • Vue.js
  • backend
  • javascript
  • PostgreSQL
  • Express
  • nest.js
  • vue-query
  • Vue
  • pinia
  • vitejs

최근 댓글

최근 글

티스토리

hELLO · Designed By 정상우.
Grace

grace's dev_note

DataScience/LeetCode

[Easy] Roman to Integer

2022. 10. 12. 10:57

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

  • I can be placed before V (5) and X (10) to make 4 and 9. 
  • X can be placed before L (50) and C (100) to make 40 and 90. 
  • C can be placed before D (500) and M (1000) to make 400 and 900.

Given a roman numeral, convert it to an integer.

 

Example 1:

Input: s = "III"
Output: 3
Explanation: III = 3.

Example 2:

Input: s = "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.

Example 3:

Input: s = "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

 

Constraints:

  • 1 <= s.length <= 15
  • s contains only the characters ('I', 'V', 'X', 'L', 'C', 'D', 'M').
  • It is guaranteed that s is a valid roman numeral in the range [1, 3999].
const roman = {
    I: 1,
    V: 5,
    X: 10,
    L: 50,
    C: 100,
    D: 500,
    M: 1000
}

var romanToInt = function(s) {
    return s.split('').reduce((acc, cur, i)=> {
        let number = roman[cur]
        if(cur==='I'){
           number = s[i+1]==='V' || s[i+1]==='X' ? -number : number
        } else if(cur==='X'){
            number = s[i+1]==='L' || s[i+1]==='C' ? -number : number
        } else if(cur==='C'){
            number = s[i+1]==='D' || s[i+1]==='M' ? -number : number
        }
        return acc + number
    }, 0)
};
const roman = {
    I: 1,
    V: 5,
    X: 10,
    L: 50,
    C: 100,
    D: 500,
    M: 1000
}

var romanToInt = function(s) {
    let sum = 0;
    let i = s.length - 1;
    let prev = 0;
    
    while (i >= 0) {
        const cur = roman[s[i]];
        sum += cur < prev ? -cur : cur;
        i--;
        prev = cur;
    }
    
    return sum;
};
저작자표시 비영리 변경금지 (새창열림)

'DataScience > LeetCode' 카테고리의 다른 글

[Easy] Sqrt(x)  (0) 2022.11.17
[Easy] Plus One  (0) 2022.11.16
[Easy] Valid Parentheses  (0) 2022.11.02
[Easy] Palindrome Number  (0) 2022.10.11
[Easy] Two Sum  (0) 2022.10.06
    'DataScience/LeetCode' 카테고리의 다른 글
    • [Easy] Plus One
    • [Easy] Valid Parentheses
    • [Easy] Palindrome Number
    • [Easy] Two Sum
    Grace
    Grace
    기술 및 회고 블로그

    티스토리툴바