| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 |
Tags
- 109. Convert Sorted List to Binary Search Tree
- 시바견
- 43. Multiply Strings
- iterator
- 컴퓨터의 구조
- Generator
- Convert Sorted List to Binary Search Tree
- Python Implementation
- Substring with Concatenation of All Words
- kaggle
- 프로그래머스
- attribute
- DWG
- data science
- Protocol
- 파이썬
- 715. Range Module
- concurrency
- Regular Expression
- Python
- 30. Substring with Concatenation of All Words
- LeetCode
- t1
- 315. Count of Smaller Numbers After Self
- 운영체제
- Decorator
- 밴픽
- Class
- shiba
- Python Code
Archives
- Today
- Total
목록Bit Operations (1)
Scribbling
Python Int Representation & Bit Operations
Each of programming language has their own way of 'Integer Representation'. In most languages, integers are represented with 32 bits and the most significant bit (the leftmost bit) is for the sign of it. As a result, usual '32-bit int representation' has range of [-2**31+1, 2**31]. * 2**31 (INT_MAX) is 0xFFFFFFFF * -2*31+1 (-INT_MAX) is 0x80000000 (by 2's complement) However, python has somewhat..
Computer Science/Python
2022. 1. 13. 12:05