关于香港的记忆

-
      和许多九零年代出生的人一样，香港黄金时代的经典电影与流行歌曲一路伴随我成长，走过梦幻的童年时代。那时的香港正处于一个如梦如幻岁月流金的年代，是一座让人对未来的充满希望，令人着迷的城市。于是想着有朝一日，定要去拜访看看。 

      工作后，去过很多地方，不知何时起渐渐觉得，和我所在的城市上海比，香港应该也只是另一座摩登都市，反而没有很想去探索的欲望。每次出门旅行，倒总是倾向去异国他乡游玩。

      去年因为上海lockdown，让我们错过了整个春天。被夺走的美好的东西，总想着找回来，那时候就再想，解封后一定要出趟远门，去呼吸那新鲜自由的空气！等过完春节回上海，一切还未从lockdown中缓过神来，考虑到当时情况，香港便成了可选的首站城市。

     2023年农历正月初十，初春，咋暖还寒，带着一路兴奋与期待，我们坐上了上海飞往香港的飞机！   
准备登机✈️



酒店旁随机的选到的一家好吃的茶餐厅


下榻的酒店让人想起了布达佩斯大饭店









   参观香港故宫博物院，看到了许多明清时期的展品，借此一窥那个时代人们的生活。
博物院的展品









街边的好吃的鸡蛋仔





在博物院的露台上俯瞰维港










     赶在黄昏日落前，爬上太平山顶，追到了最后一抹夕阳的柔光，这时山间吹来阵阵凉风，拂去白日的些许闷热，一切令人舒适松弛。





夜幕降临，圆月升起，俯瞰华灯初上的城市






未完待续...


Comments

Post a Comment

Popular posts from this blog

77.combinations

-
/* Tags backtracking * @lc app=leetcode id=77 lang=java * * [77] Combinations * * https://leetcode.com/problems/combinations/description/ * * algorithms * Medium (69.56%) * Likes: 7886 * Dislikes: 206 * Total Accepted: 822.7K * Total Submissions: 1.2M * Testcase Example: '4\n2' * * Given two integers n and k, return all possible combinations of k numbers * chosen from the range [1, n]. * * You may return the answer in any order. * * * Example 1: * * * Input: n = 4, k = 2 * Output: [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]] * Explanation: There are 4 choose 2 = 6 total combinations. * Note that combinations are unordered, i.e., [1,2] and [2,1] are considered * to be the same combination. * * * Example 2: * * * Input: n = 1, k = 1 * Output: [[1]] * Explanation: There is 1 choose 1 = 1 total combination. * * * * Constraints: * * * 1 <= n <= 20 * 1 <= k <= n * * */ // @lc code=start import java . util . ArrayList ; impor...
Read more

90.subsets-ii

-
  /* * @lc app=leetcode id=90 lang=java * * [90] Subsets II * * https://leetcode.com/problems/subsets-ii/description/ * * algorithms * Medium (56.68%) * Likes: 9237 * Dislikes: 265 * Total Accepted: 819.4K * Total Submissions: 1.4M * Testcase Example: '[1,2,2]' * * Given an integer array nums that may contain duplicates, return all possible * subsets (the power set). * * The solution set must not contain duplicate subsets. Return the solution in * any order. * * * Example 1: * Input: nums = [1,2,2] * Output: [[],[1],[1,2],[1,2,2],[2],[2,2]] * Example 2: * Input: nums = [0] * Output: [[],[0]] * * * Constraints: * * * 1 <= nums.length <= 10 * -10 <= nums[i] <= 10 * * * * 思路：使用回溯算法, 对unique数组的全排列的变种 * 问题拆分成 从n个元素的数组中选者k个元素的素全组合 * , 再收集所有子组合时去重即可 * */ // @lc code=start import java . util . ArrayList ; import java . util . List ; class Solution { public List < List < Integer >> subsetsWithDup...
Read more

40.Combination Sum II

-
/* * @lc app=leetcode id=40 lang=java * * [40] Combination Sum II * * https://leetcode.com/problems/combination-sum-ii/description/ * * algorithms * Medium (53.88%) * Likes: 9859 * Dislikes: 261 * Total Accepted: 861.2K * Total Submissions: 1.6M * Testcase Example: '[10,1,2,7,6,1,5]\n8' * * Given a collection of candidate numbers (candidates) and a target number * (target), find all unique combinations in candidates where the candidate * numbers sum to target. * * Each number in candidates may only be used once in the combination. * * Note: The solution set must not contain duplicate combinations. * * * Example 1: * * * Input: candidates = [10,1,2,7,6,1,5], target = 8 * Output: * [ * [1,1,6], * [1,2,5], * [1,7], * [2,6] * ] * * * Example 2: * * * Input: candidates = [2,5,2,1,2], target = 5 * Output: * [ * [1,2,2], * [5] * ] * * * * Constraints: * * * 1 <= candidates.length <= 100 * 1 <= candida...
Read more