技术总结之路~

方式一： public void swap(int a, int b) { int temp; temp = b; b = a; a = temp; }方式二：public void swap(int a, int b) { a = a + b; b = a - b; ...

Description Let’s call an array A a mountain if the following properties hold: A.length >= 3 There exists some 0 < i < A.length - 1 such that A[0] < A[1] < … A[i-1] < A[i] > A...

Description Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example Input: “Let’s take LeetCode ...

Description Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.ExampleInput: 5Output: 2Explanation: The binary rep...

Description Given a matrix A, return the transpose of A. The transpose of a matrix is the matrix flipped over it’s main diagonal, switching the row and column indices of the matrix.Example Input:...

Description Let’s call an array A a mountain if the following properties hold: A.length >= 3 There exists some 0 < i < A.length - 1 such that A[0] < A[1] < … A[i-1] < A[i] > A

Description We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter would cause the width of the line to exceed...

Description International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: “a” maps to “.-“, “b” maps to “-…”, “c” maps to “-.-.”, and s...

Description You’re given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how m...

Description A self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.Also, ...

Description Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.The move sequence is ...

Description Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as l...

Description The Hamming distance between two integers is the number of positions at which the corresponding bits are different. 0 ≤ x, y < 2’31. Given two integers x and y, calculate the Hamming...

Description Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not...

思路：这样需要用到位运算，是比较基础的算法题，mark一下。public int twoDataAddSmart(int a, int b) { int temp, d; while ((a & b) != 0) { temp = a ^ b; d = (a & b) << 1;// 需...

DescriptionWe are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.)A word is uncommon if it appears exactly once in on...