lewenweijia / notes

🏊 dive dive diving
1 stars 0 forks source link

整数逆序字符串化 #1

Open lewenweijia opened 5 years ago

lewenweijia commented 5 years ago

题目链接

  1. 递归版本

    
    function reverseInt(n) {
    if (!n) return '';
    
    let last = n % 10;
    let temp = parseInt(n / 10);
    return '' + (last ? last : '') + reverseInt(temp);
    }

// reverseInt(1230) -> "321" // reverseInt(1234) -> "4321"

2. 迭代版本
```js
function reverseInt(n) {
  let ans = '';

  let last;
  while (true) {
    [last, n] = [n % 10, parseInt(n / 10)];

    ans += last || '';

    if (!n) break;
  }

  return ans;
}