Silenzio, Bruno.

Silenzio, Bruno.

<Luca, 2021>

early-relationship chicken

Kids, early in any relationship

there's a phase where you don't say no to anything.

Because you want to seem interesting, adventurous, and open-minded.

I called it early-relationship chicken.

<How I Met Your Mother, s07ep14, 46mins>

The best you can hope for is to have some good company

I did finally make it up here to the house later that week,

only to find that a falling oak tree had landed in the living room.

If we'd been there, it would have crushed us like bugs.

You see, kids, there's no way of knowing for sure where the safest place is,

so the best you can hope for is to have some good company.

<How I Met Your Mother, s07ep9, Disaster Averted>

That moron should not be making big life decisions right now

Lily is only agreeing to all this

because of pregnancy brain.

Her brain is marinating in a cocktail of hormones, mood swings and jacked-up nesting instincts.

I mean, yes, right now Lily is a goodness bestowing the miracle of life,

but damn, she dumb.

That moron should not be making big life decisions right now.

<How I Met Your Mother, s07ep8, The Slutty Pumpkin Returns>

So, yes, we saw the iceberg, we warned the Titanic.But you all just steered for it anyway. Because you want to sink

Imagine, if you glimpsed the future

and you're frightened by what you saw,

what would you do with that information?

You would go to..

Who? Politicians? Captains of industry?

And how would you convince them?

With data? Facts?

The only facts they won't challenge are the ones that keep the wheels greased and the dollars rolling in.

----

The probability of widespread annihilation kept going up.

The only way to stop it was to show it.

To scare people straight.

Because what reasonable human being wouldn't be galvanized by the potential destruction of everything they have ever known or loved?

----

But how do you think this vision was received?

How do you think people responded to the prospect of imminent doom?

They gobbled it up like a chocolate eclair.

They didn't fear their demise, they repackaged it. It can be enjoyed as video games, as TV shows, books, movies.

The entire world wholeheartedly embraced the apocalypse.

Meanwhile, your Earth was crumbling all around you.

You've got simultaneous epidemics of obesity and starvation. Explain that one.

Bees and bufferflies start to disappear.

The glaciers melt.

Algae blooms all around you.

The coal mine canaries are dropping dead,

...and you won't take the hint!

In every moment, there is the possibility of a better future. But you people won't believe it.

And because you won't believe it,

you won't do what is necessary to make it a reality.

So you dwell on this terrible future, and you resign yourselves to it. For one reason,

because that future doesn't ask anything of you today.

So, yes, we saw the iceberg, we warned the Titanic.

But you all just steered for it anyway, full steam ahead.

Why?

Because you want to sink.

You gave up.

<Tomorrowland, 2015>

There are two wolves, and they're always fighting. One is darkness and despair, the other light and hope. Which one wins

There are two wolves, and they're always fighting.

One is darkness and despair, the other light and hope.

Which one wins?

The one you feed.

<Tomorrowland, 2015>

I just know that bitch is gonna take the last whole wheat-everything bagel

All my friends from high school, they're here with their wives, their kids.

Me? My date for the night is a sticky magazine.

I used to believe in destiny, you know.

I'd go to the bagel place, see a pretty girl in line, reading my favorite novel,

whistling the song that's been stuck in my head all week, and I'd think:

"Hey, maybe she's the one"

Now I think, "I just know that bitch is gonna take the last whole wheat-everything bagel."

----

It's just every day I think I believe a little less..

And thats sucks..

<How I Met Your Mother, s07ep1, The Best Man>

841, Keys and rooms

====

841, Keys and rooms

====

DFS,

for each unvisited node/island problems

====

1. 題目給予固定長度n的房間 以及房間內含的鑰匙

題目定義第一間是沒有鎖的=>DFS開始的地方

生成一個n的visited

2. DFS走過所有的鑰匙

最終for檢查visited

如果還有房間un-visited則false

====

class Solution{

public:

void DFS( vec<vec<int>>&rooms, vec<bool>&visited, int node){

  visited[node]=true

  for auto k:rooms[node]

    if( !visited[k] )

      DFS( rooms, visited, k )

}

bool VisitedRoom( vec<vec<int>>& rooms ){

  int n=rooms.size()

  vec<bool> visited(n, false)

  DFS( rooms, visited, 0 )

  int i=0

  for i-n

    if !visited[i] return false

  return true

}  

1254, Number of closed islands

====

1254, Number of closed islands

====

DFS from each unvisited node/island problem

====

a)

----

1. 題目給予一個vec<vec<char>>的網絡（grid

生成一個vec<vec<bool>>的visited

來表示這個node是不是檢查過了

//因為DFS有上下左右 可能先前被查過了

2. （看題目）定義DFS的行為:

DFS( grid, visited, i, j, m, n )

->

如果超界, 如果是'0', 如果造訪過了 return

else, 

visited改成true

這個node的上下左右去做DFS

3. 回到main（看題目）定義main的行為:

for for grid

如果是'1', 如果還沒造訪過 則

DFS( grid, visited, i, j, m, n )

count++

//因為DFS會做完, 能連到的都連完了, 才跳出

//就找到一個island

//如果for又找到 應該又是全新的island 故重新算重新加

====

class Solution{

void DFS( vec<vec<int>>&grid, vec<vec<bool>>&visited, int i, j, m, n){

  if i<0 || j<0 || i>=m || j>=n || visited(i,j) || grid(i,j)!='1'

    return

  visited(i,j)=true

  DFS( grid, visited, i-1, j, m, n)

  DFS(i+1

  DFS(j-1

  DFS(j+1

}

public:

int closedIsland (vec<vec<int>>&grid){

  int m=grid.size()

  int n=grid[0].size()

  vec<vec<bool>> visited(m, vec<bool>(n, false))

  int count=0

  for i-m

    for j-n

      if( grid [i][j] == '1' && !visited[i][j] ){

        DFS( grid, visited, i, j, m, n)

        count++

      }

  return count

}

};

1376, Time needed to inform all employees

====

1376, Time needed to inform all employees

====

DFS,

Time taken to reach all nodes, or share info to all graph nodes

====

1. 題目給予一個vec<int> manager

=>

生成一份vec<vec<int>> children

or

map<int, vec<int>> children

children用意在紀錄node擁有的child

(可視為hash map

2. 因為children會紀錄所mana<->child關係

所以從root(題目給的headID) 開始DFS

會走過所有node

3. 題目給予一個 vec<int>informTime

定義一個resource 為最終total結果

每次DFS,

一個current為加上目前informTime[i]的時間

每次DFS 比較max(resource, current)

最終return resource

====

class Solution{

int DFS( vec<vec<int>>&child, int node, vec<int>&time){

if child[node].size == 0

  return 0

  //本次node沒有children, time沒有增加, return

int ans= time[node]

int tempMax= 0

for(auto c: child[node]){

  tempMax = max( tempMax, DFS( child, c, informTime)

//如果child有多個 會停在for裡面

//當有找到更大的結果 會丟給tempMax

//當次還沒return就不會被清零

//清零用意只是紀錄當次node子集裡的最大

}

return ans+tempMax

//結果等於 當前的time[node] 

//加上

//子集裡面最大的time

}

public:

int numOfMinute( int n, int headID, vec<int>& manager, vec<int>& informTime){

vec<vec<int>> children(n)

for int i=0; i<n; i++

  if manager[i] != -1

    children[ manager[i] ].push_back(i)

return DFS( children, headID, informTime )

}

130, Surrounded regions

130, Surrounded regions

====

DFS boundary

====

1. 題目是說被1包圍的0 可以被翻牌

=>

沒有碰到邊界的0 可以被翻牌

（有連結到）碰到邊界的0無法被翻牌

2. 從邊界開始找有沒有0

當找到邊界為0, 對它的做DFS(上下左右)

找到的0, 先把它變更符號e.g.#

3. for, for go through

剩下的0是可以翻成1的

剩下的#是不能翻的 翻回0

====

class Solution{

public:

  void surroundRegion(vec<vec<char>>&board){

    int m=board.size(), n=board[0].size()

    for int i=0; i<m; i++

      if board[i][0] == 'o'

        DFS(board, i, 0, m, n)

      if board[i][n-1] == 'o'

        DFS(board, i, n-1, m, n)

    for int j=0; j<n; j++

      if board[0][j] == 'o'

        DFS(board, 0, j, m, n)

      if board[m-1] == 'o'

        DFS(board, m-1, j, m, n)

    for i-n

      for j-n

        if board[i][j] == 'o'

          board[i][j] = 'x'

        if board[i][j] == '#'

          board[i][j] = 'o'

}

void DFS(vec<vec<char>>board, int i, j, m, n){

  if i<0 || j<0 || i>=m || j>=n || board(i,j)!='o'

    return

  board(i,j) = '#'

  DFS(i-1, j, m, n)

  DFS(i+1, j, m, n)

  DFS(i, j-1, m, n)

  DFS(I, j+1, m, n

}

990, satisfiability of equality equation

====

990, satisfiability of equality equation

====

Union_find

====

1. root單元是“字母” 不是給予eq.size

//eq.size是formula size

字母-“a"的差距

即可化為單元vec<int>

2. vec<string> eq

eq[0], [3]是字母單元

eq[1]是判斷

3. go through eq兩次

第一次先處理等於

如果eq[1]=='=' 則root[ep(0)] = root[eq(0)]

第二次處理不等於

如果eq[1]=='!'

但是先前的等於eq 讓單元root相等, 則flase

====

class Solution {

vector<int> root[26]

public equationPossible(vec<string>& equations) {

  

  for 0<26; root[i] = i

  for string eq:equations

    if eq[1] == '='

      root[ find(root, eq[3] -'a') ] = find(root, eq[0] -'a')

  for string eq:equations

    if eq[1] == '!'

      if find(root, eq[3] -'a') == find(root, eq[0] -'a') 

        return false

  return true

}

find(vec<int>root, int x){

  if root[i] == x

    return x

  return find(root, root[x])

}

Graduation goggles

It's graduation goggles.

Like with highschool. It's four years of bullies,

making fun of the kids with branches,

even after the branches come off and they can walk just fine.

But then on graduation day, you suddenly get all Misty because you realize you're never gonna see those jerks again.

====

The point is, you can't trust graduation goggles.

They're just misleading as beer goggles,

bridesmaid goggles,

and "that's just a bully outdated cell phone in his front pocket" goggles.

<How I Met Your Mother, s06ep20, The exploding meatball sub>

He'll never get to see how I turn out

He'll never get to see how I turn out.

My dad.

I used to always tell him about that I was gonna be an environmental lawyer.

But he never got to see the version of me that was anything but a corporate stooge.

Lily, if we have a baby right now.

That is just it for me.

The cement will dry out, and I will be stuck at GNB, forever.

<How I Met Your Mother, s06ep17, Garbage Island>

1319, Number of operations to make network connected

====

1319, Number of operations to make network connected

====

Union find

====

1. 給予n台電腦, matrix of connection

所以matrix size至少要大約等於n-1

2. 給予root(n)紀錄單元root

如果有描述的link, root[y] = x

3. 如果有相同的root

(redundant (count++

====

class Solution:

vec<int> root(n)

public makeConnected(int n, vec<vec<int>>& con){

  int count=0, cable=con.size()

  if cable < n-1

    return -1

  else

    for i-n root[i] = I

    for i-n

      int x = getRoot(con[i][0])

      int y = getRoot(con[i][1])

      if x == y

        count++

      else

        root[y] = x

      return count

int getRoot(int i)

  if root[i] == I

    return i

  return getRoot(root[i])

947, Most stones remove with same row or column

====

947, Most stones remove with same row or column

====

1. 給予n個stones(雖然每個是座標)

因此給予一個root[n] 存放stone的root

//不要被座標混淆

2. 一樣初值n 假設每個stone單元都是獨立

3. for, for go through

每個stone, 與其他後順序的stone, 檢查座標

如果相同則root[j] = I

//是stone順序 //不要被座標混淆

最後for go through root

如果root[i] == i, (表示一個交集）加count

4. result為全部n 減去集合的count（=redundant

====

class Solution {

public removeStone(vec<vec<int>>& stone)

  int n= stone.size(), count= 0

  vec<int> root(n)

  for i-n root[i] = i

  for i; i<n; i++

    for j=i+1; j<n; j++

      if stone[i][0] == stone[j][0] ||

        stone[i][1] == stone[j][1]

          root[j] = i

  for i-n

    if root[i] == i count++

  return n-count

684, Redundant connection

====

684, Redundant connection

====

Union find

====

1. 使用一個list來紀錄每個單元的root

起始值都-1

2. for每個edge的點一，點二去找Root

如果（新的一輪edge(x, y)）x_root== y_root,

則是redundant, return edge

else, root[y]= x_root

====

class Solution {

public:

vec<int> root(2000, -1)

vec<int> findRedundant(vec<vec<int>>& M){

  

  for(int i=0; i<root.size(); i++) root[i] = i

  for(auto edge:M)

    int x = findRoot(edge[0])

    int y = findRoot(edge[1])

    if(x == y) return edge

    else

      root[y]= x

int findRoot(int i)

  if root[i] == i

    return i

  return findRoot(root[i])

If God is all powerful, He cannot be all good.

I've figured it out way back, 

if God is all powerful, He cannot be all good. And if He's all good then He cannot be all powerful.

And neither can you be. They need to see the fraud you are.

<Lex Luthor, Batman v Superman, 2016>

547, Number of provinces

====

547, Number of provinces/省

====

Union find

====

1. 使用一個list: Root紀錄每個單元的 _root

2. 預設一個group為n

(即一開始每個單元都是獨立的 可視為n的獨立集合

3. for gothrough每個link/M(I,j)

如果

M(I,j)== 1, i_root!= j_root, 則把Root[j]= i_root, group--

(找到一個單元是可以被包含的

====

class Solution:

public findProvince(vec<vec<int>>M)

  int n=M.size(), group=n

  vec<int> Root

  for i-n: Root[i]=i

  for i-n:

    for j-n:

      if M[i][j]==1

        int p1 = getRoot(Root, i)

        int p2 = getRoot(Root, j)

        if (p1 != p2)

          group--

          Root[p2] = p1

int getRoot(vec<int>&Root, int i)

  if(Root[i]!=i)

    Root[i] = Root[ Root[i] ]

    i=Root[i]

  return i

Because it's all part of the plan

The mob has plans. The cops have plans. Gordon's, got plans.

You know...they're schemers.

Schemers trying to control their little worlds.

I just did what I do best. I took your little plan and I turned it on itself.

you know what I noticed? Nobody panics when things go "according to plan"

Even if the plan is horrifying.

If tomorrow I told the press that, like, a gang-banger will get shot,

or a truck load of soldiers will be blown up, nobody panics.

Because it's all part of the plan.

But when I say that one little old mayor will die... then everyone loses their minds

Introduce a little anarchy.

Upset the established order, then everything becomes..

chaos.

I'm an agent of chaos.

Oh, and you know the thing about chaos?

It's fair.

<Joker, The Dark Knight, 2008>

國際無線電通話拼寫字母

北約音標字母

NATO phonetic alphabet

國際無線電通話拼寫字母

International rediotelephony spelling alphabet

====

A, alfa

B, bravo

C, charlie

D, delta

E, echo

F, foxtrot

G, golf

H, hotel

I, india

J, Juliette

K, kilo

L, Lima

M, mike

N, november

O, oscar

P, papa

Q, quebec

R, romeo

S, sierra

T, tengo

U, uniform

V, victor

W, whiskey

X, x-ray

Y, yankee

Z, zulu

I couldn't see worth a damn either, buddy. I just kept driving forward, hoping for the best.

And every year we wouldn't get to the cabin, until, like, middle of the night.

It would be pitch black, in the middle of the woods, and I could never see anything in front of the headlights.

But I always felt so safe, cause my dad was driving.

He was like some sort of superhero.

He could just see way out into the darkness.

Now he's just gone.

And it's pitch black.

I can't see where I'm going.

(Marvin) - Here's a secret.

I couldn't see worth a damn either, buddy.

I just kept driving forward, hoping for the best.

<How I Met Your Mother, s06ep16, Desperation Day>

我收拾好情緒 如同小時候把玩具放入箱子的角落 我知道它在那

手扶梯上來來往往的人群聲

偶爾伴隨著小孩在大廳奔跑嘻戲

人群不少 但是像路上急駛而過的車群

一樣模糊

我 在這裡 但是又不在這裡

兩眼直視前方 卻是沒有對焦的

情緒帶著我來回跺步

現在的我能幫什麼呢

是不是應該表現更穩重一點呢

又者 我還剩多少時間呢

這些問題盤據的同時

腦袋又沒頭沒腦的浮出一句

“小孩還是早點生的好”

真是夠無厘頭了 我說

“先生 可以幫我一下嗎”

那模糊的影子終於靜止 停在我面前

我收拾好情緒 如同小時候把玩具放入箱子的角落

我知道它在哪

“請問今天辦什麼業務呢” 

嘴巴動了

我知道它在那邊 我跟我自己說

等下一次影子又模糊時

我會記下現在的畫面

再把它從箱中取出

仔細著墨

2014.07.10

Do I feel lucky? Well, do ya, punk?

But being this is a .44 Magnum

The most powerful handgun in the world

And would blow your head clean off

You've got to ask yourself one question: 

'Do I feel lucky?' 

Well, do ya, punk?

<Dirty Harry, 1971>

"happily ever after" and “Oh, he’s just some guy I went to some thing with once"

One dance, one kiss,

That's the only shot you got,

Just one shot, to make the difference between

"happily ever after" 

and

“Oh, he’s just some guy 

I went to some thing with once.”

<Alex, Hitch, 2005>

This is nothing but a price I promised myself I'd pay. And I'm paying it.

This is nothing but a price I promised myself I'd pay.

And I'm paying it.

You can't just save a little girl's life then turn around, throw her to the dogs.

Not in my book, you don't.

<John Hartigan, Sin city, 2005>

好的故事可以具備什麼

好的電影可以具備什麼

更正, 好的故事可以具備什麼

1. 帶動你的情緒, 跟著劇情起伏

2. 心裡想著"對, 就是這樣, 我就是想看這個, 你打算怎麼演"

3. 可以延伸(省思)的議題, 自己有興趣多去挖掘, 可以跟別人討論分享的點

4. 可以推廣分享, 或是自己私藏, 發現也有人知道這部片時眼睛發光的感覺

5. 獨特的特徵, 可以讓你在事後會想起, 或是引用, 或是比較

6. 最難, 現在真的越來越少見:

    重複看幾次可以發現不同的觀點, 體會演員/導演可能想呈現的另一面

    (但跟情緒跟個人經歷有關, 非必要)

就算我不恨你 我還是超恨你 我就是那麼恨你

海綿：我恨你沒有原因的恨

派大：就算我不恨你，我還是超恨你，我就是那麼恨你

海綿：額

Why is the only real source of power. Without it, you are powerless.

"Why" is what separate us from them, you from me,

"Why" is the only real source of power.

Without it, you are powerless.

And this is how you came to me.

Without Why, without power.

Another link in the chain.

<Merovingian, The Matrix - Reloaded, 2003>

waffles are just pancakes with abs

waffles are just pancakes with abs

I have a teeny bladder and I don't get a hot girlfriend?

Raj: what, I have a teeny bladder and I don't get a hot girlfriend?

Howard: ...Yeah, Raj, That's how it works.

Raj: Damn...

It is my center, what is yours?

Yes! Big eyes, very big!

Because they are full of wonder!

That is my center. It is what I was born with

Eyes that have only seen the wonder in everything! 

Eyes that see lights in the trees and magic in the air.

This wonder is what I put into the world

And what I protect in children.

It is what makes me a guardian.

It is my center, what is yours?

<North, Rise of the Guardians, 2012>

Remember, remember. The 5th of November, the Gunpowder Treason Plot

Remember, remember

The 5th of November, the Gunpowder Treason Plot

I know of not reason why the 

Gunpowder Treason should ever be forgot.

<V of vendetta, 2005>

BECAUSE you made a phone call!

BECAUSE you made a phone call!

<Enemy of the State, 1998>

https://m.youtube.com/watch?v=Vh4Q3A0jvKY

拆開層之間的時間與代價 你願不願意接受

或許吧，每個人其實本質

（或是說基本需求 組成

到頭來都可以說是差不多的

基本生理需求，基本道德觀念

再加諸個人的生活，經驗，社會，價值上去

或許了解一個人不難

問題是，要拆開多少層，你才能試著了解一個人

問題是，拆開層之間的時間與代價

你願不願意接受

I feel like the maid

I feel like the maid.

I just cleaned up this mess.

Can we keep it clean for ten minutes?

<Mr incredible, The incredibles, 2004>

Spectacular spectacular

I mean the show will be...

magnificent, opulent,

tremendous, stupendous,

gargantuan bedazzlement.

A sensual ravishment.

It will be...

Spectacular spectacular!

<Moulin Rouge, 2001>

You either die a Spongebob. Or live long enough to see yourself become a Squidward

You either die a Spongebob.

Or live long enough to see yourself become a Squidward!

Success, not greatness, was the only god the entire world served

Success,

not greatness, 

was the only god the entire world served

<Drew Baylor, Elizabethtown, 2005>

The people who are trying to make this world worse are not taking a day off. How can I?

The people who are trying to make this world worse are not taking a day off. 

How can I?

<I am legend, 2007>

Forgiveness is between them and God. It's my job to arrange the meeting

Forgiveness is between them and God. 

It's my job to arrange the meeting 

<Creasy, Man On Fire, 2004>

This is what happens when you drill, you can't use your...USA Air Time Only Drill Card!

"This is what happens when you drill, 

you can't use your...

USA Air Time Only Drill Card!

...Who wrote this thing anyways..."

<Harry, Armageddon, 1998>

那些年我們追的韓劇韓綜 -2021

12月

====

海岸村恰恰恰

運動天才安宰賢

11月

====

ITZY CSI2- codename: secret ITZY 2

如蝶翩翩

10月

====

出差十五夜- 電影天坑

出差十五夜- BH

我是遺物整理師

9月

====

盼望的大海, since Aug/21

出差十五夜- 宋旻浩的丟失

8月

====

出差十五夜- 宋旻浩的pilot, 瑞典

出差十五夜- 宋旻浩的pilot, 遺失

出差十五夜- 宋旻浩的pilot, 繪畫

出差十五夜- 宋旻浩的pilot, 睡眠

Dreamcatcher Mind, since May/21

7月

====

帶輪子的家2

Heize偶然的食譜

6月

====

尹STAY

春季露營spring camp

5月

====

STAYCATION, since May/21

對麵包是真心, since Mar/21

4月

====

機智露營生活

3月

====

出差十五夜x機智露營生活

BVNDIT.ZIP

1月

====

奔跑的關係

獅子吃素的那一天

獅子吃素的那一天

====

2022.01

====

十個難搞行為留下的創傷:

驕傲

批評

自我中心主義

缺乏聆聽

優越感

控制狂

具有攻擊性

沒耐心

刻薄

缺乏同情心

面對難搞行為:

1.逃跑:

屬於恐懼的情緒範圍 確保你安全無慮

2.反擊:

在非暴力的情況下

表達出健康且適當的憤怒情緒

3.壓抑:

情緒停留在自己

讓自己變得無奈 悲傷 沮喪等（需盡快脫離這種狀況

抵制難搞行為:

1.知道如何設限:

如果你沒有言明自己的底線

別人也不知道怎麼尊重你

因此在進行溝通前先說明“可以接受與不行”的部分

並且用周遭的親友（甚至職場的同事

建立起遵守這個底線的默契

2.學習說不:

練習果斷 堅決 但不帶侵略性地說“不”

跳針模式 堅定的重申立場

「我知道你會為此不開心 但對我而言 我也不接受這種批評」

3.培養自信:

增加自信的技巧在於修煉內涵

鞏固自己的成果與累積人脈

善加利用這些珍貴的資源

====

心理成長訣竅:

1. 溝通（成為善於溝通的人:

----

一, 傾聽: 真誠的同理心 積極的傾聽

二, 理解: 歡迎且理解對方的資訊或是情緒

三, 重整: 重新組織對方的資訊 使對方感覺獲得理解認同

四, 邀請: 邀請對方尋找有利的解決方案或是妥協方式

五, 醞釀: 給予對方其他有益的認可訊號 使溝通產生積極 具建設性的結果

勸言的三個技巧:

簡單扼要的方式表達事實;

以“我”作為句子開頭來取代“你”;

表達你的需求和期待 找到能和對話者一起達成的協議或妥協;

2. 表達感謝:

真誠的感謝遠大於點到為止的禮貌

時時保有這樣心態的人 也能保有良好健康的情緒

3. 寬恕（懂得請求:

懂得請求寬恕 實際上為自己 也為別人送了一份禮物

同時也是表明自己願意接受檢視

願意認知自己的缺失並做出修正

4. 宇宙中的位置:

離遠一點來看待事物的不同視角

若是我們在宇宙中 便會知道自己微小的有如塵埃

5. 自己的宇宙:

試著用模型來建立你的宇宙 把周圍的人放在對應的位置上

是不是有些人佔據太多空間？

或是有些人被你遺忘？

你是否看到了失衡或是想改變的事？

6. 太陽:

將優質的愛與時間 給予他人,孩童,寵物,植物

就是幸福的關鍵

7. 換位思考:

勇敢改變自己的觀點

了解對方正在經歷的事情

整合不同於自己的價值觀與感知

接受差異

甚至在必要時謙虛地質疑自己 從差異中學習 鍛鍊靈活度,寬容,同理心

8. 不難搞的範本:

標誌出自己認為最不難搞的模範人物

閱讀他們的傳記 想像他們會怎麼處理事情

9. 內心頻率:

選擇自己內心的頻率

建立友善的心理狀態

釋放內心頻率改變你與外在的關係

影響“受你吸引” 和“吸引你”的東西

10. 積極的意圖:

學習在笑容與眼神中表達積極的意圖

送給日常中的對話者

讓善良 慷慨佔據你對他人的每個凝視與微笑

11. 行動的方針:

每個人都需要一個指導方針 既能有鼓舞的作用

也能帶領和改變行為

養成真善美的態度 便是有益的生活哲學

12. 小丑博佐:

當你覺得自己太過認真時

輕碰你的鼻子然後說“博佐”

就像你戴上紅鼻子一樣

提醒自己暫時抽離

保持幽默感 懂得自嘲

13. 筆記本:

思考自己的難搞行為

筆記下來

並想一下觸發的原因 同時想像解決方案

避免再次傷害

14. 心靈教練:

當你對自己感到懷疑

想像一位心靈導師

他是你最好的朋友與指導員

這位朋友會跟你說什麼 會怎麼鼓勵你

15, 淘汰換新:

存著不良記錄的舊光碟

往往收納了自孩童以來的故事 包含負面的影響

侷限的思考 古板的行為模式

著手處理 更換成嶄新的光碟

（正向的思考與行動

16. 開明專制:

各種層面上照顧好自己的身體與心理

就能為周遭的人帶來最棒的服務

17. 男女平衡:

在男性女性間找到平衡

提升自己的女性特質

保持圓潤 保有同理心 保持冷靜

18. 關店:

太多工作計畫只會讓你更加疲憊

學習設下停損點

放手花點時間來恢復自己精力

19. 放手:

達到目標前 如果你總是想要“不惜一切代價”

“以最快速度取得” “立刻” “達標”等情緒壓抑自己

往往欲速則不達

放手

專業自己的注意力 做些其他事情（可以的話盡量體力訓練

再來

練習讓內心回歸平靜與耐心 迫使超速的大腦冷靜下來

20. 精實毒藥:

污染的大腦製造出來的思想 都是精神上的毒藥:

嫉妒, 慾望, 易怒, 自我貶低, 不健康的比較

保持意識

當你發現自己正在受毒藥侵蝕時

告訴自己停下來

做些基礎的功課

了解這些毒藥的來龍去脈

克制產出

21. 活在當下:

練習擁有完全的意識

關閉胡思亂想的模式

並打開五種感官

讓自己活在當下 專注自己的呼吸 留心觀察周圍正在發生的事

22. 他人的凝視:

對你來說重要的事 未必對別人來說是重要的

當你發現大家都盯著你的時候

後退一步

越能確認自己是怎樣的人

別人對你的接受度也越高

自我懷疑和猶豫是裂縫 給愛說三道四批評的機會

23. 責任感:

衝突 分歧 委屈

通常來自把錯誤歸咎於他人

沒有想到所有與事件有關的人物都必須負責

對對方釋出善意 釐清錯誤 與責任的歸屬

彼此間的不協調也能獲得矯正

24. 細緻的差別:

避免用非黑即白的觀點評斷人 事

提升自己的情商 培養自己的敏銳度

觀察別人且提醒自己不可以放大不合理與不適合的情緒