- 博客(99)
- 收藏
- 关注
RSS订阅翻译 C++ Templates 第二版 附录C 重载决议 英翻中
附录C 重载决议重载决议就是根据给定的调用表达式来选择函数去调用的过程。考虑如下的简单例子:void display_num(int); //#1void display_num(double); //#2int main(){display_num(399); //#1 matches better than #2display_num(3.99); //#2 matches better than #1}在这个例子中，函数名display_num()是被重载的。当这个
2020-07-26 23:10:22
520
原创 C++条件运算符的返回类型
稍微总结了一下，还是有很多不明白的地方的。有一些是粘贴自cppreference.com的条件运算符表达式的形式为E1 ? E2 : E3对条件运算符的第一操作数求值并将其按语境转换为 bool。当第一操作数的值计算和所有副作用完成之后，若结果为 true，则求值第二操作数。若结果为 false，则求值第三操作数。条件表达式 E1 ? E2 : E3 的类型和值类别按照下列规则确定：1. 若 E2 或 E3 具有 void 类型，则下列之一必须为真，否则程序非良构：1.1 E2.
2020-07-09 23:51:22
1534
2
翻译 C++ Templates 第二版 附录B
最近开始看C++ Templates （第二版）的英文版，自行翻译其中一些章节，给自己将来回顾的时候看，需要配合英文版服用附录B 值的种类表达式是C++语言的基石，提供了表达计算的主要机制。每一个表达式都有一个类型，描述了其计算产生的值的静态类型。表达式“7”的类型是int，和表达式"5+2"一样，以及和表达式”x”一样，如果x的int类型变量的话。每一个表达式也有一个“值的种类”， 这描述了其值是如何组成的，并影响表达式的行为。B.1 传统的左值和右值在历史上，曾经只有左值和右值两种.
2020-06-28 16:50:14
711
原创 (Java)LeetCode-72. Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:
2016-11-09 17:03:29
525
原创 (Java)LeetCode-71. Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case where path
2016-11-09 10:29:53
366
原创 (Java)LeetCode-70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?这道题是一个比较经典比较简单的问题。
2016-11-06 16:01:21
633
原创 (Java)LeetCode-69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.这道题么，当然最简单的方法就是一行代码 return（int）Math.sqrt(x);不过出于强迫症，还是用二分法又写了一遍代码。需要注意的地方是循环应该是while(left public int mySq
2016-11-03 16:02:19
596
原创 (Java)LeetCode-68. Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You should pack your words in a greedy approach; that i
2016-11-02 22:37:03
363
原创 (Java)LeetCode-67. Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".这道题也是木有什么难度，总体来说和上一题很像。从后向前遍历一遍即可。注意有进位的情况。public String addBinary(S
2016-11-02 17:01:53
414
原创 (Java)LeetCode-66. Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.这道题题意刚开始没看明白。。
2016-11-02 15:03:05
792
原创 (Java)LeetCode-65. Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo
2016-10-07 20:41:05
387
原创 (Java)LeetCode-64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at
2016-10-07 16:25:49
953
原创 LeetCode-63. Unique Paths II
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the
2016-10-07 15:30:13
279
原创 (Java)LeetCode-62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the
2016-10-06 21:54:21
588
原创 (Java)LeetCode-61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.这道题也不是很难。循环右移一个链表。要注意的是循环的位数可能会
2016-10-06 17:52:28
880
原创 (Java)LeetCode-60. Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3
2016-10-05 23:52:58
870
原创 (Java)LeetCode-59. Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [
2016-10-05 22:21:08
256
原创 (Java)LeetCode-58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is
2016-10-05 20:56:26
252
原创 (Java)LeetCode-57. Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.E
2016-10-05 15:49:00
373
原创 (Java)LeetCode-56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].这道题是Hard难度，看上去确实比较麻烦。最后居然AC了比较开心，虽然只打败了30%
2016-10-04 22:27:08
396
原创 (Java)LeetCode-55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i
2016-10-04 14:03:21
252
原创 (Java)LeetCode-54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]
2016-10-03 17:53:49
275
原创 (Java)LeetCode-53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] ha
2016-10-03 16:52:38
280
原创 (Java)LeetCode-52. N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.这一题和上一题一样嘛。。代码几乎一模一样，就是返回原来的List的Size而已~代码如下：public cla
2016-10-02 13:24:46
268
原创 (Java)LeetCode-51. N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.
2016-10-01 21:51:19
263
原创 (Java)LeetCode-50. Pow(x, n)
Implement pow(x, n).这道题最慢时间复杂度也是O(n)，快一些的是O（logn），主要是将n考虑为二进制的形式，某一位是1的话，就乘上相应的次方数即可。代码如下：public class Solution { public double myPow(double x, int n) { if(
2016-10-01 17:44:19
573
原创 (Java)LeetCode-49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: Al
2016-09-29 23:06:19
228
原创 (Java)LeetCode-48. Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?这道题木有什么难度，原地顺时针旋转一个矩阵90度，要求时间复杂度O（n2），空间复杂度
2016-09-29 15:36:17
968
原创 (Java)LeetCode-47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1
2016-09-28 13:57:43
403
原创 (Java)LeetCode-46. Permutations
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],
2016-09-28 13:11:17
268
原创 (Java)LeetCode-45. Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal i
2016-09-27 23:15:41
310
原创 (Java)LeetCode-44.Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t
2016-09-20 15:46:35
854
原创 (Java)LeetCode-43. Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note:The numbers can be arbitrarily large and are non-negative.Converting the input string to integ
2016-09-16 22:56:51
385
原创 (Java)LeetCode-42. Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]
2016-09-16 20:22:17
302
原创 (Java)LeetCode-41. First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant
2016-09-16 15:07:59
517
原创 (Java)LeetCode-40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina
2016-08-11 23:33:03
1206
原创 (Java)LeetCode-39. Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numb
2016-08-10 22:35:30
387
原创 (Java)LeetCode-37. Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku
2016-08-09 21:36:31
739
原创 (Java)LeetCode-306. Additive Number
Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the
2016-08-08 20:59:59
564
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人