-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
89 lines (81 loc) · 2.13 KB
/
Solution.java
File metadata and controls
89 lines (81 loc) · 2.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
package algorithm.leetcode;
import java.util.List;
/**
* @Author: eric
* @Date: 2022/2/12 9:23 上午
*/
public class Solution {
public static void main(String[] args) {
Character har = 'a';
Solution solution = new Solution();
solution.isOneBitCharacter(new int[] { 0, 1, 0 });
}
/**
* 两数之和
* @param nums
* @param target
* @return
*/
public static int[] twoSum(int[] nums, int target) {
int returnArr[] = new int[] { -1, -1 };
for (int i = 0; i < nums.length; i++) {
boolean flag = false;
for (int j = 0; j < returnArr.length; j++) {
if (i == returnArr[j]) {
flag = true;
}
}
if (flag) {
continue;
}
boolean flag1 = false;
for (int k = i + 1; k < nums.length; k++) {
if (nums[i] == target - nums[k]) {
returnArr[0] = i;
returnArr[1] = k;
flag1 = true;
continue;
}
}
if (flag1) {
break;
}
}
return returnArr;
}
/**
* 两数之差
* @param nums
* @param target
* @return
*/
public static int countKDifference(int[] nums, int target) {
int count = 0;
int len = nums.length;
for (int i = 0; i < len; i++) {
for (int k = i + 1; k < len; k++) {
if (nums[i] - nums[k] == target || nums[i] - nums[k] == -target) {
count++;
}
}
}
return count;
}
public boolean isOneBitCharacter(int[] bits) {
int length = bits.length - 1;
boolean flag = true;
for (int i = 0; i < length; i++) {
int bit = bits[i];
if (bit == 1) {
i++;
}
if (i >= length){
flag = false;
}
}
return flag;
}
public List<String> findRepeatedDnaSequences(String s) {
return null;
}
}