Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit ff66400

Browse filesBrowse files
committed
updates
1 parent a940ace commit ff66400
Copy full SHA for ff66400

File tree

6 files changed

+22
-23
lines changed
Filter options

6 files changed

+22
-23
lines changed

‎.idea/workspace.xml

Copy file name to clipboardExpand all lines: .idea/workspace.xml
+14-14Lines changed: 14 additions & 14 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.
Binary file not shown.
Binary file not shown.

‎src/com/company/Lecture10/Dictionary.java

Copy file name to clipboardExpand all lines: src/com/company/Lecture10/Dictionary.java
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ public static void main(String[] args) {
1212
// System.out.println(Arrays.toString(nums));
1313

1414
// lexo("",nums,line.length());
15-
lexoNum(0,15);
15+
lexoNum(0,11);
1616
}
1717

1818
public static int[] freq(String chars){

‎src/com/company/Lecture11/SumDivideArray.java

Copy file name to clipboardExpand all lines: src/com/company/Lecture11/SumDivideArray.java
+3-5Lines changed: 3 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -8,11 +8,9 @@
88

99
public class SumDivideArray {
1010
public static void main(String[] args) {
11-
int[] nums ={1 ,2 ,3 ,3 ,4 ,5};
12-
divide(nums, 0,0,0,new ArrayList<Integer>(),new ArrayList<Integer>());
13-
14-
// sumTarget(nums,0,10,0,new ArrayList<Integer>());
15-
11+
int[] nums ={-1,3,7,4,2,1};
12+
divide(nums, 0,0,0,new ArrayList<>(),new ArrayList<>());
13+
// sumTarget(nums,0,10,0,new ArrayList<>());
1614
}
1715

1816
public static void divide(int[] nums,int index, int sum1, int sum2, ArrayList<Integer> list1,ArrayList<Integer> list2){

‎src/com/company/Lecture7/Bitwise_Examples.java

Copy file name to clipboardExpand all lines: src/com/company/Lecture7/Bitwise_Examples.java
+4-3Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -32,14 +32,15 @@ public static void main(String[] args) {
3232

3333
public static int oddOcc(int[] nums){
3434
int res = 0;
35-
for (int i = 0; i < nums.length ; i++) {
36-
res = res ^ nums[i];
35+
for (int num : nums) {
36+
res = res ^ num;
3737
}
3838
return res;
3939
}
4040

4141
public static boolean isOdd( int n){
42-
return (n & 1) == 0; //If returns 1 : odd else even.
42+
return (n & 1) == 0;
43+
//If returns 1 : odd else even.
4344
}
4445

4546
public static int countOne(int n){

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.