Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.
If the fractional part is repeating, enclose the repeating part in parentheses.
more >>
Ethan Joe
敲石101下
LeetCode (Math) Sqrt(x)
Sqrt(x)
Implement int sqrt(int x).
Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.
more >>LeetCode (Math) Excel Sheet Column Number
Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number.
For example:
1 | A -> 1 |
LeetCode (Math) Factorial Trailing Zeroes
Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.
Example 1:
1 | Input: 3 |
Example 2:
1 | Input: 5 |
Note: Your solution should be in logarithmic time complexity.
more >>LeetCode(Math)Happy Number
Happy Number
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 of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
more >>Insert Delete GetRandom O(1)
Insert Delete GetRandom O(1)
Design a data structure that supports all following operations in average O(1) time.
insert(val): Inserts an item val to the set if not already present.remove(val): Removes an item val from the set if present.getRandom: Returns a random element from current set of elements. Each element must have the same probability of being returned.d
Serialize and Deserialize Binary Tree
Serialize and Deserialize Binary Tree
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
more >>LeetCode(DP)Longest Increasing Subsequence
Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.
Example:
1 | Input: [10,9,2,5,3,7,101,18] |
Note:
- There may be more than one LIS combination, it is only necessary for you to return the length.
- Your algorithm should run in O(n2) complexity.
Follow up: Could you improve it to O(n log n) time complexity?
more >>面试笔试7.4(多益网络)
题目：给定一个集合S（没有重复元素），输出它所有的子集
比如输入1,2,3。输出1,2,12,3,13,23,123。
思路：这道题肯定刷过，可是面试的时候死活想不起来，可能是太紧张了吧。后来找了找，果然在leetcode上找到了原题：
Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
more >>tag:
- LeetCode
- 字符串
- 算法初级
- 面经
- JSP
- JavaWeb
- Design
- Midum
- Array&String
- BackTracking
- Medium
- Dynamic Programming
- Primary
- DP
- medium
- LinkedList
- Math
- Others
- Sort&Search
- Tree
- Sort&Serach
- MVC
- 事务
- 读书笔记
- JVM
- 内存
- 对象
- 垃圾收集
- SwordToOffer
- programming
- 链表
- 二叉树
- 算法
- 快速幂
- 排序
- 二维数组，查找
- 数组
- 链表，排序
- 字符串，算法初级
- Permutation
- 丑数
- 排序，高级排序
- plan
- 逆序对
- 项目记录，C#
- 项目
- 测试功能
- 项目笔记
- 项目记录
- 回溯法
- 树
- 笔试，多益网络
- 动态规划，真题练习
- Programming
- String
- 翻转单词列
- 项目记录，问答社区
- 面试笔试
缺失模块。
1、请确保node版本大于6.2
2、在博客根目录（注意不是yilia根目录）执行以下命令：
npm i hexo-generator-json-content --save
3、在根目录_config.yml里添加配置：
jsonContent:
meta: false
pages: false
posts:
title: true
date: true
path: true
text: false
raw: false
content: false
slug: false
updated: false
comments: false
link: false
permalink: false
excerpt: false
categories: false
tags: true
<br>当一切看起来无济于事的时候，<br>我去看一个石匠敲石头。<br>他一连敲了100次，石头仍然纹丝不动。<br>但他敲击第101次的时候，石头裂为两半。<br>可我知道，让石头裂开的不是那最后一击，<br>而是前面100次敲击的结果。