Commitcf709d9

committed

add 816

1 parente20244a commitcf709d9Copy full SHA for cf709d9

File tree

+48

-0

lines changed

+48

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -468,6 +468,7 @@ _If you like this project, please leave me a star._ ★`
`468`	`468`	`\|821\|[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_821.java)\|\|Easy\|`
`469`	`469`	`\|820\|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_820.java)\|\|Medium\|`
`470`	`470`	`\|819\|[Most Common Word](https://leetcode.com/problems/most-common-word/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) \| \|Easy\| HashMap`
	`471`	`+\|816\|[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) \| \|Medium\| String`
`471`	`472`	`\|814\|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) \| \|Medium\| recursion, DFS`
`472`	`473`	`\|811\|[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) \| \|Easy\| HashMap`
`473`	`474`	`\|809\|[Expressive Words](https://leetcode.com/problems/expressive-words/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_809.java)\|\|Medium\|`

Lines changed: 47 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,47 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importjava.util.ArrayList;`
	`4`	`+importjava.util.List;`
	`5`	`+`
	`6`	`+publicclass_816 {`
	`7`	`+publicstaticclassSolution1 {`
	`8`	`+publicList<String>ambiguousCoordinates(Strings) {`
	`9`	`+s =s.substring(1,s.length() -1);`
	`10`	`+List<String>list =newArrayList<>();`
	`11`	`+for (inti =1;i <s.length();i++) {`
	`12`	`+Stringx =s.substring(0,i);`
	`13`	`+List<String>xs =findAllPossibilities(x);`
	`14`	`+Stringy =s.substring(i);`
	`15`	`+List<String>ys =findAllPossibilities(y);`
	`16`	`+for (Stringj :xs) {`
	`17`	`+for (Stringk :ys) {`
	`18`	`+list.add("(" +j +", " +k +")");`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+returnlist;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+privateList<String>findAllPossibilities(Stringstr) {`
	`26`	`+List<String>result =newArrayList<>();`
	`27`	`+if (str.length() ==1) {`
	`28`	`+result.add(str);`
	`29`	`+returnresult;`
	`30`	`+ }else {`
	`31`	`+for (inti =1;i <str.length();i++) {`
	`32`	`+StringintegerPart =str.substring(0,i);`
	`33`	`+StringfloatPart =str.substring(i);`
	`34`	`+if (integerPart.length() >1 &&integerPart.charAt(0) !='0' &&floatPart.charAt(floatPart.length() -1) !='0') {`
	`35`	`+result.add(integerPart +"." +floatPart);`
	`36`	`+ }elseif (integerPart.length() ==1 &&floatPart.charAt(floatPart.length() -1) !='0') {`
	`37`	`+result.add(integerPart +"." +floatPart);`
	`38`	`+ }`
	`39`	`+ }`
	`40`	`+if (str.charAt(0) !='0') {`
	`41`	`+result.add(str);`
	`42`	`+ }`
	`43`	`+ }`
	`44`	`+returnresult;`
	`45`	`+ }`
	`46`	`+ }`
	`47`	`+}`

Comments

(0)