May Yeung mayyuen318
mayyuen318
/ mcdonalds.json
Last active
June 26, 2019 07:33
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Input: | |
| 1. Search: Mcdonalds | |
| 2. Region: hk | |
| --------------------------[1]-------------------------- | |
| { | |
| "html_attributions" : [], | |
| "next_page_token" : "xxxx" | |
| { | |
| "formatted_address" : "Langham Place Shopping Mall, 8 Argyle St, Mong Kok", |
mayyuen318
/ chowtaifook.json
Created
June 26, 2019 04:11
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Input parameter: | |
| 1. Search: Chow Tai Fook | |
| 2. Region: hk | |
| -------------------------[1]------------------------- | |
| { | |
| "html_attributions" : [], | |
| "next_page_token" : "CpQCAQEAAMce1-W1pkbp09dcEyMjr0bcvofX-Dk1T5HCWpH4Pm4Fn9oj0IDdiyGrtn5oRLIjOFtoCCFs7Yu919Gg2CMxiw2XOTkri3BfdehcK_LmEBIPWsLB8bkAYqr7zqx3oCDkgZ-yQHJoh03-iRbQVRrLb7ev3OUchM-5yEKpk3fYJO4opSPn1QVt-dkqoIahzqKg7Ng9U_PyVbHRpp8oO3jymrf8Pi8miDulh4TsXTYV_It0D0vPgLZGwweTN6zuxRpR-PzNeRyq4ZYXMTT0NnLflvPx_vA3HUs2k1o2WmqhFinCK5QmF_2-sOoCg9cDk-cWkaWcwHAV0jxuDxSYXAuy99rAF_rkwOAbklcY2iEkGF7VEhACBF2AdRqqFfEbEZ-E605UGhQkqXNIXXltyePirnKRuA55AezDhw", | |
| "results" : [ |
mayyuen318
/ Sudoku.java
Created
May 22, 2015 13:23
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.HashSet; | |
| import java.util.Set; | |
| public class Sudoku { | |
| public static boolean checkRow(int[][] sudoku) { | |
| for (int i = 0; i < 9; i++) { | |
| Set<Integer> row = new HashSet<Integer>(); | |
| for(int j = 0; j < 9; j++) { | |
| if (sudoku[i][j] != 0) { |