linc101的专栏

Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot

Description:Count the number of prime numbers less than a non-negative number, n.有三点优化偶数排除掉只除已经判别出来的素数只除小于目标数平方根的数此题决计还有很多优化空间。（待续）/** * @param {number} n * @return {number

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999./** * @param {string} s * @return {number} */var romanToInt = function(s) {

Remove Linked List Elements两个版本，一个原始版（196ms），一个略微优化过的版本（176ms）感觉leetcode对js的支持还是有些问题，两版本提交的结果还是有些差异的。/** * Definition for singly-linked list. * function ListNode(val) { * this

Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 00000000

Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 001110010

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c