auto commit
This commit is contained in:
@ -19,7 +19,7 @@
|
||||
* [15. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 <20>ĸ<EFBFBD><C4B8><EFBFBD>](#15-<2D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>-1-<2D>ĸ<EFBFBD><C4B8><EFBFBD>)
|
||||
* [<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ĵ<EFBFBD><C4B4><EFBFBD>](#<23><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>-<2D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ĵ<EFBFBD><C4B4><EFBFBD>)
|
||||
* [16. <20><>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>η<EFBFBD>](#16-<2D><>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>η<EFBFBD>)
|
||||
* [18. ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>](#18-ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>)
|
||||
* [18.2 ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>](#182-ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>)
|
||||
* [19. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽƥ<CABD><C6A5>](#19-<2D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽƥ<CABD><C6A5>)
|
||||
* [20. <20><>ʾ<EFBFBD><CABE>ֵ<EFBFBD><D6B5><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>](#20-<2D><>ʾ<EFBFBD><CABE>ֵ<EFBFBD><D6B5><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>)
|
||||
* [21. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><CBB3>ʹ<EFBFBD><CAB9><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>ż<EFBFBD><C5BC>ǰ<EFBFBD><C7B0>](#21-<2D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><CBB3>ʹ<EFBFBD><CAB9><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>ż<EFBFBD><C5BC>ǰ<EFBFBD><C7B0>)
|
||||
@ -541,12 +541,16 @@ int maxProductAfterCuttin(int length) {
|
||||
|
||||
## 15. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1 <20>ĸ<EFBFBD><C4B8><EFBFBD>
|
||||
|
||||
ʹ<EFBFBD>ÿ⺯<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
```java
|
||||
public int NumberOf1(int n) {
|
||||
return Integer.bitCount(n);
|
||||
}
|
||||
```
|
||||
|
||||
O(lgM) ʱ<>临<EFBFBD>ӶȽⷨ<C8BD><E2B7A8><EFBFBD><EFBFBD><EFBFBD><EFBFBD> M <20><>ʾ 1 <20>ĸ<EFBFBD><C4B8><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
n&(n-1) <20><>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȥ<EFBFBD><C8A5> n <20><>λ<EFBFBD><CEBB><EFBFBD><EFBFBD>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD>͵<EFBFBD><CDB5><EFBFBD>һλ<D2BB><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڶ<EFBFBD><DAB6><EFBFBD><EFBFBD>Ʊ<EFBFBD>ʾ 10110100<30><30><EFBFBD><EFBFBD>ȥ 1 <20>õ<EFBFBD> 10110011<31><31><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD> 10110000<30><30>
|
||||
|
||||
```java
|
||||
@ -558,7 +562,6 @@ public int NumberOf1(int n) {
|
||||
}
|
||||
return cnt;
|
||||
}
|
||||
|
||||
```
|
||||
|
||||
# <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ĵ<EFBFBD><C4B4><EFBFBD>
|
||||
@ -580,7 +583,7 @@ public double Power(double base, int exponent) {
|
||||
}
|
||||
```
|
||||
|
||||
## 18. ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>
|
||||
## 18.2 ɾ<><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><D8B8>Ľ<EFBFBD><C4BD><EFBFBD>
|
||||
|
||||
```java
|
||||
public ListNode deleteDuplication(ListNode pHead) {
|
||||
@ -641,6 +644,10 @@ public boolean isNumeric(char[] str) {
|
||||
|
||||
## 21. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><CBB3>ʹ<EFBFBD><CAB9><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>ż<EFBFBD><C5BC>ǰ<EFBFBD><C7B0>
|
||||
|
||||
**<EFBFBD><EFBFBD>ĿҪ<EFBFBD><EFBFBD>**
|
||||
|
||||
<EFBFBD><EFBFBD>֤<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ż<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ż<EFBFBD><EFBFBD>֮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD>ò<EFBFBD><EFBFBD>䣬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>鱾<EFBFBD><EFBFBD>̫һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
ʱ<EFBFBD>临<EFBFBD>Ӷ<EFBFBD> : O(n<sup>2</sup>)
|
||||
<EFBFBD>ռ临<EFBFBD>Ӷ<EFBFBD> : O(1)
|
||||
|
||||
@ -695,8 +702,6 @@ public ListNode FindKthToTail(ListNode head, int k) {
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
|
||||
## 23. <20><><EFBFBD><EFBFBD><EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڽ<EFBFBD><DABD><EFBFBD>
|
||||
|
||||
```java
|
||||
@ -1455,8 +1460,6 @@ public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
|
||||
|
||||
## 53 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>г<EFBFBD><D0B3>ֵĴ<D6B5><C4B4><EFBFBD>
|
||||
|
||||
|
||||
|
||||
```java
|
||||
public int GetNumberOfK(int[] array, int k) {
|
||||
int l = 0, h = array.length - 1;
|
||||
@ -1735,8 +1738,9 @@ public int maxProfit(int[] prices) {
|
||||
|
||||
```java
|
||||
public int Sum_Solution(int n) {
|
||||
if(n == 0) return 0;
|
||||
return n + Sum_Solution(n - 1);
|
||||
int sum = n;
|
||||
boolean b = (n > 0) && ((sum += Sum_Solution(n - 1)) > 0);
|
||||
return sum;
|
||||
}
|
||||
```
|
||||
|
||||
|
Reference in New Issue
Block a user