Commit f40ce40

author

C5141506

committed

Leetcode problems

1 parent 38ac251 commit f40ce40Copy full SHA for f40ce40

File tree

+58

-0

lines changed

src/main/problems/java_problem
- array
  - Duplicates.java
- string
  - FormStringFromAnother.java

+58

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,24 @@`
	`1`	`+package java_problem.array;`
	`2`	`+`
	`3`	`+import java.util.ArrayList;`
	`4`	`+import java.util.List;`
	`5`	`+`
	`6`	`+public class Duplicates {`
	`7`	`+ public static void main(String args[]){`
	`8`	`+ int[] nums=new int[]{4,3,2,7,8,2,3,1};`
	`9`	`+ findDuplicates(nums);`
	`10`	`+ }`
	`11`	`+ public static List<Integer> findDuplicates(int[] nums) {`
	`12`	`+ List<Integer> res = new ArrayList();`
	`13`	`+`
	`14`	`+ for (int i = 0; i < nums.length; i++) {`
	`15`	`+ int idx = Math.abs(nums[i]) - 1;`
	`16`	`+ if (nums[idx] < 0) {`
	`17`	`+ res.add(idx + 1);`
	`18`	`+ }`
	`19`	`+ nums[idx] = -nums[idx];`
	`20`	`+ }`
	`21`	`+`
	`22`	`+ return res;`
	`23`	`+ }`
	`24`	`+}`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+package java_problem.string;`
	`2`	`+`
	`3`	`+import java.util.HashMap;`
	`4`	`+import java.util.Map;`
	`5`	`+`
	`6`	`+public class FormStringFromAnother {`
	`7`	`+ public static void main(String args[]) {`
	`8`	`+ System.out.println(isStringPossible("ababt", "cat"));`
	`9`	`+ }`
	`10`	`+`
	`11`	`+ public static boolean isStringPossible(String s1, String s2) {`
	`12`	`+ int n1 = s1.length();`
	`13`	`+ int n2 = s2.length();`
	`14`	`+ Map<Integer, Integer> map = new HashMap<>();`
	`15`	`+ for (int i = 0; i < n1; i++) {`
	`16`	`+ int c = (int) s1.charAt(i);`
	`17`	`+ if (map.containsKey(c)) {`
	`18`	`+ map.put(c, map.get(c) + 1);`
	`19`	`+ } else`
	`20`	`+ map.put(c, 1);`
	`21`	`+ }`
	`22`	`+ for (int i = 0; i < n2; i++) {`
	`23`	`+ int c = s2.charAt(i);`
	`24`	`+ if (map.containsKey(c) && map.get(c) > 0) {`
	`25`	`+ map.put(c, map.get(c) - 1);`
	`26`	`+ } else if (map.containsKey(c - 1) && map.containsKey(c - 2) && map.get(c - 1) > 0 && map.get(c - 2) > 0) {`
	`27`	`+ map.put(c - 1, map.get(c - 1) - 1);`
	`28`	`+ map.put(c - 2, map.get(c - 2) - 1);`
	`29`	`+ } else`
	`30`	`+ return false;`
	`31`	`+ }`
	`32`	`+ return true;`
	`33`	`+ }`
	`34`	`+}`

Comments

(0)